Multiple adaptive loop filter sets

ABSTRACT

A video encoder may be configured to encode multiple adaptive loop filter sets in an adaptation parameter set associated with the video data. A video decoder may receive the multiple adaptive loop filter sets in the adaptation parameter set associated with video data, determine one or more adaptive loop filters from the multiple adaptive loop filter sets, and apply the determined one or more adaptive loop filters to the video data.

This application claims the benefit of U.S. Provisional Application No. 62/705,992, filed Jul. 24, 2020, the entire content of which is incorporated by reference herein.

TECHNICAL FIELD

This disclosure relates to video encoding and video decoding.

BACKGROUND

Digital video capabilities can be incorporated into a wide range of devices, including digital televisions, digital direct broadcast systems, wireless broadcast systems, personal digital assistants (PDAs), laptop or desktop computers, tablet computers, e-book readers, digital cameras, digital recording devices, digital media players, video gaming devices, video game consoles, cellular or satellite radio telephones, so-called “smart phones,” video teleconferencing devices, video streaming devices, and the like. Digital video devices implement video coding techniques, such as those described in the standards defined by MPEG-2, MPEG-4, ITU-T H.263, ITU-T H.264/MPEG-4, Part 10, Advanced Video Coding (AVC), ITU-T H.265/High Efficiency Video Coding (HEVC), and extensions of such standards. The video devices may transmit, receive, encode, decode, and/or store digital video information more efficiently by implementing such video coding techniques.

Video coding techniques include spatial (intra-picture) prediction and/or temporal (inter-picture) prediction to reduce or remove redundancy inherent in video sequences. For block-based video coding, a video slice (e.g., a video picture or a portion of a video picture) may be partitioned into video blocks, which may also be referred to as coding tree units (CTUs), coding units (CUs) and/or coding nodes. Video blocks in an intra-coded (I) slice of a picture are encoded using spatial prediction with respect to reference samples in neighboring blocks in the same picture. Video blocks in an inter-coded (P or B) slice of a picture may use spatial prediction with respect to reference samples in neighboring blocks in the same picture or temporal prediction with respect to reference samples in other reference pictures. Pictures may be referred to as frames, and reference pictures may be referred to as reference frames.

SUMMARY

In general, this disclosure describes techniques for coding video data using an adaptive loop filter. In particular, this disclosure describes techniques for encoding and decoding data indicative of multiple adaptive loop filter sets and determining adaptive loop filters for a particular adaptive loop filter set of the multiple adaptive loop filter sets. The techniques of this disclosure may allow for better content adaptation and coding efficiency by providing multiple adaptive loop filter sets from which to determine an adaptive loop filter. In addition, techniques are described for signaling the multiple adaptive loop filter sets, which may allow signaling with a relatively low overhead cost.

In one example, this disclosure describes a method of decoding video data, the method comprising receiving multiple adaptive loop filter sets in an adaptation parameter set associated with the video data, determining one or more adaptive loop filters from the multiple adaptive loop filter sets, and applying the determined one or more adaptive loop filters to the video data.

In another example, this disclosure describes an apparatus configured to decode video data, the apparatus comprising a memory configured to store the video data, and one or more processors implemented in circuitry and in communication with the memory, the one or more processors configured to receive multiple adaptive loop filter sets in an adaptation parameter set associated with the video data, determine one or more adaptive loop filters from the multiple adaptive loop filter sets, and apply the determined one or more adaptive loop filters to the video data.

In another example, this disclosure describes an apparatus configured to decode video data, the apparatus comprising means for receiving multiple adaptive loop filter sets in an adaptation parameter set associated with the video data, means for determining one or more adaptive loop filters from the multiple adaptive loop filter sets, and means for applying the determined one or more adaptive loop filters to the video data.

In another example, this disclosure describes a non-transitory computer-readable storage medium storing instructions that, when executed, cause one or more processors of a device configured to decode video data to receive multiple adaptive loop filter sets in an adaptation parameter set associated with the video data, determine one or more adaptive loop filters from the multiple adaptive loop filter sets, and apply the determined one or more adaptive loop filters to the video data.

The details of one or more examples are set forth in the accompanying drawings and the description below. Other features, objects, and advantages will be apparent from the description, drawings, and claims.

BRIEF DESCRIPTION OF DRAWINGS

FIG. 1 is a block diagram illustrating an example video encoding and decoding system that may perform the techniques of this disclosure.

FIG. 2 is a conceptual diagram illustrating example adaptive loop filter shapes.

FIG. 3 is a conceptual diagram illustrating example subsampled Laplacian values for a 4×4 sub-block adaptive loop filter classification.

FIG. 4 is a conceptual diagram illustrating example Laplacian values for a luma sample.

FIG. 5 is a conceptual diagram illustrating an example of adaptive loop filter class merging.

FIG. 6 is a conceptual diagram illustrating example geometric transformations of 7×7 diamond filter shapes.

FIG. 7 is a conceptual diagram illustrating one example of symmetrical sample padding of luma adaptive loop filtering at a virtual boundary.

FIG. 8 is a conceptual diagram illustrating another example of symmetrical sample padding of luma adaptive loop filtering at a virtual boundary.

FIG. 9 is a conceptual diagram illustrating another example of symmetrical sample padding of luma adaptive loop filtering at a virtual boundary.

FIG. 10 is a conceptual diagram illustrating adaptive loop filter 4×4 sub-block classification at a virtual boundary.

FIGS. 11A and 11B are conceptual diagrams illustrating an example quadtree binary tree (QTBT) structure, and a corresponding coding tree unit (CTU).

FIG. 12 is a block diagram illustrating an example video encoder that may perform the techniques of this disclosure.

FIG. 13 is a block diagram illustrating an example video decoder that may perform the techniques of this disclosure.

FIG. 14 is a flowchart illustrating an example method for encoding a current block in accordance with the techniques of this disclosure.

FIG. 15 is a flowchart illustrating an example method for decoding a current block in accordance with the techniques of this disclosure.

FIG. 16 is a flowchart illustrating another example method for decoding a current block in accordance with the techniques of this disclosure.

DETAILED DESCRIPTION

In general, this disclosure describes techniques for coding video data using an adaptive loop filter. In particular, this disclosure describes techniques for encoding and decoding data indicative of multiple adaptive loop filter sets and determining adaptive loop filters for a particular adaptive loop filter set of the multiple adaptive loop filter sets. The techniques of this disclosure may allow for better content adaptation and coding efficiency by providing multiple adaptive loop filter sets from which to determine an adaptive loop filter. In addition, the described techniques may include techniques for signaling the multiple adaptive loop filter sets, which may allow signaling with a relatively low overhead cost.

FIG. 1 is a block diagram illustrating an example video encoding and decoding system 100 that may perform the techniques of this disclosure. The techniques of this disclosure are generally directed to coding (encoding and/or decoding) video data. In general, video data includes any data for processing a video. Thus, video data may include raw, unencoded video, encoded video, decoded (e.g., reconstructed) video, and video metadata, such as signaling data.

As shown in FIG. 1, system 100 includes a source device 102 that provides encoded video data to be decoded and displayed by a destination device 116, in this example. In particular, source device 102 provides the video data to destination device 116 via a computer-readable medium 110. Source device 102 and destination device 116 may comprise any of a wide range of devices, including desktop computers, notebook (i.e., laptop) computers, mobile devices, tablet computers, set-top boxes, telephone handsets such as smartphones, televisions, cameras, display devices, digital media players, video gaming consoles, video streaming device, broadcast receiver devices, or the like. In some cases, source device 102 and destination device 116 may be equipped for wireless communication, and thus may be referred to as wireless communication devices.

In the example of FIG. 1, source device 102 includes video source 104, memory 106, video encoder 200, and output interface 108. Destination device 116 includes input interface 122, video decoder 300, memory 120, and display device 118. In accordance with this disclosure, video encoder 200 of source device 102 and video decoder 300 of destination device 116 may be configured to apply the techniques for adaptive loop filtering. Thus, source device 102 represents an example of a video encoding device, while destination device 116 represents an example of a video decoding device. In other examples, a source device and a destination device may include other components or arrangements. For example, source device 102 may receive video data from an external video source, such as an external camera. Likewise, destination device 116 may interface with an external display device, rather than include an integrated display device.

System 100 as shown in FIG. 1 is merely one example. In general, any digital video encoding and/or decoding device may perform techniques for adaptive loop filtering. Source device 102 and destination device 116 are merely examples of such coding devices in which source device 102 generates coded video data for transmission to destination device 116. This disclosure refers to a “coding” device as a device that performs coding (encoding and/or decoding) of data. Thus, video encoder 200 and video decoder 300 represent examples of coding devices, in particular, a video encoder and a video decoder, respectively. In some examples, source device 102 and destination device 116 may operate in a substantially symmetrical manner such that each of source device 102 and destination device 116 includes video encoding and decoding components. Hence, system 100 may support one-way or two-way video transmission between source device 102 and destination device 116, e.g., for video streaming, video playback, video broadcasting, or video telephony.

In general, video source 104 represents a source of video data (i.e., raw, unencoded video data) and provides a sequential series of pictures (also referred to as “frames”) of the video data to video encoder 200, which encodes data for the pictures. Video source 104 of source device 102 may include a video capture device, such as a video camera, a video archive containing previously captured raw video, and/or a video feed interface to receive video from a video content provider. As a further alternative, video source 104 may generate computer graphics-based data as the source video, or a combination of live video, archived video, and computer-generated video. In each case, video encoder 200 encodes the captured, pre-captured, or computer-generated video data. Video encoder 200 may rearrange the pictures from the received order (sometimes referred to as “display order”) into a coding order for coding. Video encoder 200 may generate a bitstream including encoded video data. Source device 102 may then output the encoded video data via output interface 108 onto computer-readable medium 110 for reception and/or retrieval by, e.g., input interface 122 of destination device 116.

Memory 106 of source device 102 and memory 120 of destination device 116 represent general purpose memories. In some examples, memories 106, 120 may store raw video data, e.g., raw video from video source 104 and raw, decoded video data from video decoder 300. Additionally or alternatively, memories 106, 120 may store software instructions executable by, e.g., video encoder 200 and video decoder 300, respectively. Although memory 106 and memory 120 are shown separately from video encoder 200 and video decoder 300 in this example, it should be understood that video encoder 200 and video decoder 300 may also include internal memories for functionally similar or equivalent purposes. Furthermore, memories 106, 120 may store encoded video data, e.g., output from video encoder 200 and input to video decoder 300. In some examples, portions of memories 106, 120 may be allocated as one or more video buffers, e.g., to store raw, decoded, and/or encoded video data.

Computer-readable medium 110 may represent any type of medium or device capable of transporting the encoded video data from source device 102 to destination device 116. In one example, computer-readable medium 110 represents a communication medium to enable source device 102 to transmit encoded video data directly to destination device 116 in real-time, e.g., via a radio frequency network or computer-based network. Output interface 108 may modulate a transmission signal including the encoded video data, and input interface 122 may demodulate the received transmission signal, according to a communication standard, such as a wireless communication protocol. The communication medium may comprise any wireless or wired communication medium, such as a radio frequency (RF) spectrum or one or more physical transmission lines. The communication medium may form part of a packet-based network, such as a local area network, a wide-area network, or a global network such as the Internet. The communication medium may include routers, switches, base stations, or any other equipment that may be useful to facilitate communication from source device 102 to destination device 116.

In some examples, source device 102 may output encoded data from output interface 108 to storage device 112. Similarly, destination device 116 may access encoded data from storage device 112 via input interface 122. Storage device 112 may include any of a variety of distributed or locally accessed data storage media such as a hard drive, Blu-ray discs, DVDs, CD-ROMs, flash memory, volatile or non-volatile memory, or any other suitable digital storage media for storing encoded video data.

In some examples, source device 102 may output encoded video data to file server 114 or another intermediate storage device that may store the encoded video data generated by source device 102. Destination device 116 may access stored video data from file server 114 via streaming or download.

File server 114 may be any type of server device capable of storing encoded video data and transmitting that encoded video data to the destination device 116. File server 114 may represent a web server (e.g., for a website), a server configured to provide a file transfer protocol service (such as File Transfer Protocol (FTP) or File Delivery over Unidirectional Transport (FLUTE) protocol), a content delivery network (CDN) device, a hypertext transfer protocol (HTTP) server, a Multimedia Broadcast Multicast Service (MBMS) or Enhanced MBMS (eMBMS) server, and/or a network attached storage (NAS) device. File server 114 may, additionally or alternatively, implement one or more HTTP streaming protocols, such as Dynamic Adaptive Streaming over HTTP (DASH), HTTP Live Streaming (HLS), Real Time Streaming Protocol (RTSP), HTTP Dynamic Streaming, or the like.

Destination device 116 may access encoded video data from file server 114 through any standard data connection, including an Internet connection. This may include a wireless channel (e.g., a Wi-Fi connection), a wired connection (e.g., digital subscriber line (DSL), cable modem, etc.), or a combination of both that is suitable for accessing encoded video data stored on file server 114. Input interface 122 may be configured to operate according to any one or more of the various protocols discussed above for retrieving or receiving media data from file server 114, or other such protocols for retrieving media data.

Output interface 108 and input interface 122 may represent wireless transmitters/receivers, modems, wired networking components (e.g., Ethernet cards), wireless communication components that operate according to any of a variety of IEEE 802.11 standards, or other physical components. In examples where output interface 108 and input interface 122 comprise wireless components, output interface 108 and input interface 122 may be configured to transfer data, such as encoded video data, according to a cellular communication standard, such as 4G, 4G-LTE (Long-Term Evolution), LTE Advanced, 5G, or the like. In some examples where output interface 108 comprises a wireless transmitter, output interface 108 and input interface 122 may be configured to transfer data, such as encoded video data, according to other wireless standards, such as an IEEE 802.11 specification, an IEEE 802.15 specification (e.g., ZigBee™), a Bluetooth™ standard, or the like. In some examples, source device 102 and/or destination device 116 may include respective system-on-a-chip (SoC) devices. For example, source device 102 may include an SoC device to perform the functionality attributed to video encoder 200 and/or output interface 108, and destination device 116 may include an SoC device to perform the functionality attributed to video decoder 300 and/or input interface 122.

The techniques of this disclosure may be applied to video coding in support of any of a variety of multimedia applications, such as over-the-air television broadcasts, cable television transmissions, satellite television transmissions, Internet streaming video transmissions, such as dynamic adaptive streaming over HTTP (DASH), digital video that is encoded onto a data storage medium, decoding of digital video stored on a data storage medium, or other applications.

Input interface 122 of destination device 116 receives an encoded video bitstream from computer-readable medium 110 (e.g., a communication medium, storage device 112, file server 114, or the like). The encoded video bitstream may include signaling information defined by video encoder 200, which is also used by video decoder 300, such as syntax elements having values that describe characteristics and/or processing of video blocks or other coded units (e.g., slices, pictures, groups of pictures, sequences, or the like). Display device 118 displays decoded pictures of the decoded video data to a user. Display device 118 may represent any of a variety of display devices such as a liquid crystal display (LCD), a plasma display, an organic light emitting diode (OLED) display, or another type of display device.

Although not shown in FIG. 1, in some examples, video encoder 200 and video decoder 300 may each be integrated with an audio encoder and/or audio decoder, and may include appropriate MUX-DEMUX units, or other hardware and/or software, to handle multiplexed streams including both audio and video in a common data stream. If applicable, MUX-DEMUX units may conform to the ITU H.223 multiplexer protocol, or other protocols such as the user datagram protocol (UDP).

Video encoder 200 and video decoder 300 each may be implemented as any of a variety of suitable encoder and/or decoder circuitry, such as one or more microprocessors, digital signal processors (DSPs), application specific integrated circuits (ASICs), field programmable gate arrays (FPGAs), discrete logic, software, hardware, firmware or any combinations thereof. When the techniques are implemented partially in software, a device may store instructions for the software in a suitable, non-transitory computer-readable medium and execute the instructions in hardware using one or more processors to perform the techniques of this disclosure. Each of video encoder 200 and video decoder 300 may be included in one or more encoders or decoders, either of which may be integrated as part of a combined encoder/decoder (CODEC) in a respective device. A device including video encoder 200 and/or video decoder 300 may comprise an integrated circuit, a microprocessor, and/or a wireless communication device, such as a cellular telephone.

Video encoder 200 and video decoder 300 may operate according to a video coding standard, such as ITU-T H.265, also referred to as High Efficiency Video Coding (HEVC) or extensions thereto, such as the multi-view and/or scalable video coding extensions. Alternatively, video encoder 200 and video decoder 300 may operate according to other proprietary or industry standards, such as ITU-T H.266, also referred to as Versatile Video Coding (VVC). A draft of the VVC standard is described in Bross, et al. “Versatile Video Coding (Draft 10),” Joint Video Experts Team (JVET) of ITU-T SG 16 WP 3 and ISO/IEC JTC 1/SC 29/WG 11, 18^(th) Meeting: by teleconference, 22 Jun.-1 Jul. 2020, JVET-52001-vA (hereinafter “VVC Draft 10”). The techniques of this disclosure, however, are not limited to any particular coding standard.

In general, video encoder 200 and video decoder 300 may perform block-based coding of pictures. The term “block” generally refers to a structure including data to be processed (e.g., encoded, decoded, or otherwise used in the encoding and/or decoding process). For example, a block may include a two-dimensional matrix of samples of luminance and/or chrominance data. In general, video encoder 200 and video decoder 300 may code video data represented in a YUV (e.g., Y, Cb, Cr) format. That is, rather than coding red, green, and blue (RGB) data for samples of a picture, video encoder 200 and video decoder 300 may code luminance and chrominance components, where the chrominance components may include both red hue and blue hue chrominance components. In some examples, video encoder 200 converts received RGB formatted data to a YUV representation prior to encoding, and video decoder 300 converts the YUV representation to the RGB format. Alternatively, pre- and post-processing units (not shown) may perform these conversions.

This disclosure may generally refer to coding (e.g., encoding and decoding) of pictures to include the process of encoding or decoding data of the picture. Similarly, this disclosure may refer to coding of blocks of a picture to include the process of encoding or decoding data for the blocks, e.g., prediction and/or residual coding. An encoded video bitstream generally includes a series of values for syntax elements representative of coding decisions (e.g., coding modes) and partitioning of pictures into blocks. Thus, references to coding a picture or a block should generally be understood as coding values for syntax elements forming the picture or block.

HEVC defines various blocks, including coding units (CUs), prediction units (PUs), and transform units (TUs). According to HEVC, a video coder (such as video encoder 200) partitions a coding tree unit (CTU) into CUs according to a quadtree structure. That is, the video coder partitions CTUs and CUs into four equal, non-overlapping squares, and each node of the quadtree has either zero or four child nodes. Nodes without child nodes may be referred to as “leaf nodes,” and CUs of such leaf nodes may include one or more PUs and/or one or more TUs. The video coder may further partition PUs and TUs. For example, in HEVC, a residual quadtree (RQT) represents partitioning of TUs. In HEVC, PUs represent inter-prediction data, while TUs represent residual data. CUs that are intra-predicted include intra-prediction information, such as an intra-mode indication.

As another example, video encoder 200 and video decoder 300 may be configured to operate according to VVC. According to VVC, a video coder (such as video encoder 200) partitions a picture into a plurality of coding tree units (CTUs). Video encoder 200 may partition a CTU according to a tree structure, such as a quadtree-binary tree (QTBT) structure or Multi-Type Tree (MTT) structure. The QTBT structure removes the concepts of multiple partition types, such as the separation between CUs, PUs, and TUs of HEVC. A QTBT structure includes two levels: a first level partitioned according to quadtree partitioning, and a second level partitioned according to binary tree partitioning. A root node of the QTBT structure corresponds to a CTU. Leaf nodes of the binary trees correspond to coding units (CUs).

In an MTT partitioning structure, blocks may be partitioned using a quadtree (QT) partition, a binary tree (BT) partition, and one or more types of triple tree (TT) (also called ternary tree (TT)) partitions. A triple or ternary tree partition is a partition where a block is split into three sub-blocks. In some examples, a triple or ternary tree partition divides a block into three sub-blocks without dividing the original block through the center. The partitioning types in MTT (e.g., QT, BT, and TT), may be symmetrical or asymmetrical.

In some examples, video encoder 200 and video decoder 300 may use a single QTBT or MTT structure to represent each of the luminance and chrominance components, while in other examples, video encoder 200 and video decoder 300 may use two or more QTBT or MTT structures, such as one QTBT/MTT structure for the luminance component and another QTBT/MTT structure for both chrominance components (or two QTBT/MTT structures for respective chrominance components).

Video encoder 200 and video decoder 300 may be configured to use quadtree partitioning per HEVC, QTBT partitioning, MTT partitioning, or other partitioning structures. For purposes of explanation, the description of the techniques of this disclosure is presented with respect to QTBT partitioning. However, it should be understood that the techniques of this disclosure may also be applied to video coders configured to use quadtree partitioning, or other types of partitioning as well.

In some examples, a CTU includes a coding tree block (CTB) of luma samples, two corresponding CTBs of chroma samples of a picture that has three sample arrays, or a CTB of samples of a monochrome picture or a picture that is coded using three separate color planes and syntax structures used to code the samples. A CTB may be an N×N block of samples for some value of N such that the division of a component into CTBs is a partitioning. A component is an array or single sample from one of the three arrays (luma and two chroma) that compose a picture in 4:2:0, 4:2:2, or 4:4:4 color format or the array or a single sample of the array that compose a picture in monochrome format. In some examples, a coding block is an M×N block of samples for some values of M and N such that a division of a CTB into coding blocks is a partitioning.

The blocks (e.g., CTUs or CUs) may be grouped in various ways in a picture. As one example, a brick may refer to a rectangular region of CTU rows within a particular tile in a picture. A tile may be a rectangular region of CTUs within a particular tile column and a particular tile row in a picture. A tile column refers to a rectangular region of CTUs having a height equal to the height of the picture and a width specified by syntax elements (e.g., such as in a picture parameter set). A tile row refers to a rectangular region of CTUs having a height specified by syntax elements (e.g., such as in a picture parameter set) and a width equal to the width of the picture.

In some examples, a tile may be partitioned into multiple bricks, each of which may include one or more CTU rows within the tile. A tile that is not partitioned into multiple bricks may also be referred to as a brick. However, a brick that is a true subset of a tile may not be referred to as a tile.

The bricks in a picture may also be arranged in a slice. A slice may be an integer number of bricks of a picture that may be exclusively contained in a single network abstraction layer (NAL) unit. In some examples, a slice includes either a number of complete tiles or only a consecutive sequence of complete bricks of one tile.

This disclosure may use “N×N” and “N by N” interchangeably to refer to the sample dimensions of a block (such as a CU or other video block) in terms of vertical and horizontal dimensions, e.g., 16×16 samples or 16 by 16 samples. In general, a 16×16 CU will have 16 samples in a vertical direction (y=16) and 16 samples in a horizontal direction (x=16). Likewise, an N×N CU generally has N samples in a vertical direction and N samples in a horizontal direction, where N represents a nonnegative integer value. The samples in a CU may be arranged in rows and columns. Moreover, CUs need not necessarily have the same number of samples in the horizontal direction as in the vertical direction. For example, CUs may comprise N×M samples, where M is not necessarily equal to N.

Video encoder 200 encodes video data for CUs representing prediction and/or residual information, and other information. The prediction information indicates how the CU is to be predicted in order to form a prediction block for the CU. The residual information generally represents sample-by-sample differences between samples of the CU prior to encoding and the prediction block.

To predict a CU, video encoder 200 may generally form a prediction block for the CU through inter-prediction or intra-prediction. Inter-prediction generally refers to predicting the CU from data of a previously coded picture, whereas intra-prediction generally refers to predicting the CU from previously coded data of the same picture. To perform inter-prediction, video encoder 200 may generate the prediction block using one or more motion vectors. Video encoder 200 may generally perform a motion search to identify a reference block that closely matches the CU, e.g., in terms of differences between the CU and the reference block. Video encoder 200 may calculate a difference metric using a sum of absolute difference (SAD), sum of squared differences (SSD), mean absolute difference (MAD), mean squared differences (MSD), or other such difference calculations to determine whether a reference block closely matches the current CU. In some examples, video encoder 200 may predict the current CU using uni-directional prediction or bi-directional prediction.

Some examples of VVC also provide an affine motion compensation mode, which may be considered an inter-prediction mode. In affine motion compensation mode, video encoder 200 may determine two or more motion vectors that represent non-translational motion, such as zoom in or out, rotation, perspective motion, or other irregular motion types.

To perform intra-prediction, video encoder 200 may select an intra-prediction mode to generate the prediction block. Some examples of VVC provide sixty-seven intra-prediction modes, including various directional modes, as well as planar mode and DC mode. In general, video encoder 200 selects an intra-prediction mode that describes neighboring samples to a current block (e.g., a block of a CU) from which to predict samples of the current block. Such samples may generally be above, above and to the left, or to the left of the current block in the same picture as the current block, assuming video encoder 200 codes CTUs and CUs in raster scan order (left to right, top to bottom).

Video encoder 200 encodes data representing the prediction mode for a current block. For example, for inter-prediction modes, video encoder 200 may encode data representing which of the various available inter-prediction modes is used, as well as motion information for the corresponding mode. For uni-directional or bi-directional inter-prediction, for example, video encoder 200 may encode motion vectors using advanced motion vector prediction (AMVP) or merge mode. Video encoder 200 may use similar modes to encode motion vectors for affine motion compensation mode.

Following prediction, such as intra-prediction or inter-prediction of a block, video encoder 200 may calculate residual data for the block. The residual data, such as a residual block, represents sample by sample differences between the block and a prediction block for the block, formed using the corresponding prediction mode. Video encoder 200 may apply one or more transforms to the residual block, to produce transformed data in a transform domain instead of the sample domain. For example, video encoder 200 may apply a discrete cosine transform (DCT), an integer transform, a wavelet transform, or a conceptually similar transform to residual video data. Additionally, video encoder 200 may apply a secondary transform following the first transform, such as a mode-dependent non-separable secondary transform (MDNSST), a signal dependent transform, a Karhunen-Loeve transform (KLT), or the like. Video encoder 200 produces transform coefficients following application of the one or more transforms.

As noted above, following any transforms to produce transform coefficients, video encoder 200 may perform quantization of the transform coefficients. Quantization generally refers to a process in which transform coefficients are quantized to possibly reduce the amount of data used to represent the transform coefficients, providing further compression. By performing the quantization process, video encoder 200 may reduce the bit depth associated with some or all of the transform coefficients. For example, video encoder 200 may round an n-bit value down to an m-bit value during quantization, where n is greater than m. In some examples, to perform quantization, video encoder 200 may perform a bitwise right-shift of the value to be quantized.

Following quantization, video encoder 200 may scan the transform coefficients, producing a one-dimensional vector from the two-dimensional matrix including the quantized transform coefficients. The scan may be designed to place higher energy (and therefore lower frequency) transform coefficients at the front of the vector and to place lower energy (and therefore higher frequency) transform coefficients at the back of the vector. In some examples, video encoder 200 may utilize a predefined scan order to scan the quantized transform coefficients to produce a serialized vector, and then entropy encode the quantized transform coefficients of the vector. In other examples, video encoder 200 may perform an adaptive scan. After scanning the quantized transform coefficients to form the one-dimensional vector, video encoder 200 may entropy encode the one-dimensional vector, e.g., according to context-adaptive binary arithmetic coding (CABAC). Video encoder 200 may also entropy encode values for syntax elements describing metadata associated with the encoded video data for use by video decoder 300 in decoding the video data.

To perform CABAC, video encoder 200 may assign a context within a context model to a symbol to be transmitted. The context may relate to, for example, whether neighboring values of the symbol are zero-valued or not. The probability determination may be based on a context assigned to the symbol.

Video encoder 200 may further generate syntax data, such as block-based syntax data, picture-based syntax data, and sequence-based syntax data, to video decoder 300, e.g., in a picture header, a block header, a slice header, or other syntax data, such as a sequence parameter set (SPS), picture parameter set (PPS), or video parameter set (VPS). Video decoder 300 may likewise decode such syntax data to determine how to decode corresponding video data.

In this manner, video encoder 200 may generate a bitstream including encoded video data, e.g., syntax elements describing partitioning of a picture into blocks (e.g., CUs) and prediction and/or residual information for the blocks. Ultimately, video decoder 300 may receive the bitstream and decode the encoded video data.

In general, video decoder 300 performs a reciprocal process to that performed by video encoder 200 to decode the encoded video data of the bitstream. For example, video decoder 300 may decode values for syntax elements of the bitstream using CABAC in a manner substantially similar to, albeit reciprocal to, the CABAC encoding process of video encoder 200. The syntax elements may define partitioning information for partitioning of a picture into CTUs, and partitioning of each CTU according to a corresponding partition structure, such as a QTBT structure, to define CUs of the CTU. The syntax elements may further define prediction and residual information for blocks (e.g., CUs) of video data.

The residual information may be represented by, for example, quantized transform coefficients. Video decoder 300 may inverse quantize and inverse transform the quantized transform coefficients of a block to reproduce a residual block for the block. Video decoder 300 uses a signaled prediction mode (intra- or inter-prediction) and related prediction information (e.g., motion information for inter-prediction) to form a prediction block for the block. Video decoder 300 may then combine the prediction block and the residual block (on a sample-by-sample basis) to reproduce the original block. Video decoder 300 may perform additional processing, such as performing a deblocking process to reduce visual artifacts along boundaries of the block.

This disclosure may generally refer to “signaling” certain information, such as syntax elements. The term “signaling” may generally refer to the communication of values for syntax elements and/or other data used to decode encoded video data. That is, video encoder 200 may signal values for syntax elements in the bitstream. In general, signaling refers to generating a value in the bitstream. As noted above, source device 102 may transport the bitstream to destination device 116 substantially in real time, or not in real time, such as might occur when storing syntax elements to storage device 112 for later retrieval by destination device 116.

In accordance with the techniques of this disclosure, as will be explained in more detail below, video encoder 200 and video decoder 300 may be configured to code multiple adaptive loop filter sets in an adaptation parameter set, and apply one or more adaptive loop filters from the multiple adaptive loop filter sets to video data.

Filtering

In VVC, an adaptive loop filter (ALF) may be applied to minimize the mean square error between original samples and filtered samples. In some examples, the input samples of an adaptive loop filter are the output samples of a sample adaptive offset (SAO) filter. The output samples of an ALF are stored in a decoded picture buffer (DPB) or sent out as output pictures. The filter shapes of the ALF adopted in the joint exploration model (JEM) software were 5×5, 7×7 and 9×9 diamond shapes. Video encoder 200 may select and signal the filter shape at the picture level. To obtain a better trade-off between coding efficiency and filter complexity, in VVC, only a 7×7 diamond shape 400 and a 5×5 diamond shape 402 are supported for luma and chroma components, respectively, as shown in FIG. 2. FIG. 2 shows example ALF filter shapes in VVC version 1.

In one example, for each filter, an integer coefficient c_(i) is represented with 7-bit fractional precision. The absolute value of c_(i) is coded by using a 0^(th) order Exp-Golomb code followed by a sign bit for a non-zero coefficient. In FIG. 2, each square corresponds to a luma sample or chroma sample and the center square corresponds to a current, to-be-filtered sample. To reduce the overhead associated with sending coefficients and the number of multiplications, the filter shapes in FIG. 2 are point-symmetrical. In addition, as shown in equation (1), the sum of all filter coefficients shall be equal to 128, which is the fixed-point representation of 1.0 with 7-bit fractional precision.

$\begin{matrix} {{{2{\sum\limits_{i = 0}^{N - 2}\; c_{i}}} + c_{N - 1}} = 128} & (1) \end{matrix}$

In equation (1), N is the number of coefficients and N is equal to 13 and 7 for 7×7 and 5×5 filter shapes, respectively.

In VVC, nonlinearity is introduced to ALF. Video encoder 200 and video decoder 300 may apply a simple clipping function to reduce the impact of a neighboring sample value when the difference between the neighboring sample value and a current, to-be-filtered sample value is too large. To filter a sample, the ALF process is performed as:

$\begin{matrix} {{\overset{\sim}{R}\left( {x,y} \right)} = {{R\left( {x,y} \right)} + {\left\lbrack {{\sum\limits_{i = 0}^{N - 2}\;{c_{i}\left( {f_{i,0} + f_{i,1}} \right)}} + 64} \right\rbrack\mspace{14mu}\text{>>}\mspace{14mu} 7}}} & (2) \end{matrix}$

where R(x,y) is a sample value after SAO filtering.

The non-linear function is defined with a clipping functions as:

f _(i,j)=min(b _(i),max(−b _(i) ,R(x+x _(i,j) ,y+y _(i,j))−R(x,y)))  (3)

where j is equal to 0 or 1, and (x_(i,j), y_(i,j)) are filter tap position offsets of the ith coefficient c_(i).

In VVC version 1, as in equation (4), the clipping parameter b_(i) for a coefficient c_(i) is determined by a clipping index d_(i). In equation (4), BD is the internal bit depth.

$\begin{matrix} {b_{i} = \left\{ \begin{matrix} {{2^{BD},}\mspace{59mu}} & {{{when}\mspace{14mu} d_{i}} = 0} \\ {2^{{BD} - 1 - {2d_{i}}},} & {{otherwise}\mspace{25mu}} \end{matrix} \right.} & (4) \end{matrix}$

In a filter, both the number of signaled coefficients and the number of signaled clipping indices are N−1. In one example, each coefficient is limited in the range of [−128, 127], which is equivalent to [−1.0, 1.0) with 7-bit fractional precision. In one example, each clipping index d_(i) can be 0, 1, 2 or 3 and is signaled by using a two-bit fixed length code. To simplify the clipping operation, as in equation (4), the value of a clipping parameter b_(i) can only be a power of 2. Therefore, simple bit-wise logical operations can be applied as clipping operations.

Sub-Block Level Filter Adaptation

In VVC version 1, ALF follows the same luma classification framework as ALF in JEM-7.0. To obtain a better tradeoff between coding efficiency and calculation complexity, the block size for classification may be increased to 4×4 samples from 2×2 samples. To determine the class index of a 4×4 block, a surrounding window with 8×8 luma samples is employed to derive direction and activity information. In this 8×8 luma samples window, four gradient values of every second sample are first calculated, as shown in FIG. 3. FIG. 3 illustrates subsampled Laplacian values for a 4×4 sub-block 404 (gray squares) for ALF classification. Gradient values of samples marked with a dot are calculated. Gradient values of other samples are set to 0. For each sample with coordinates (k,l), FIG. 4 illustrates the four gradient values: horizontal gradient H 406, vertical gradient V 408, 135 degree gradient D1 410, and 45 degree gradient D2 412, which are derived as:

H _(k,l)=|2R(k,l)−R(k−1,l)−R(k+1,l)|

V _(k,l)=|2R(k,l)−R(k,l−1)−R(k,l+1)|

D1_(k,l)=|2R(k,l)−R(k−1,l−1)−R(k+1,l+1)|

D2_(k,l)=|2R(k,l)−R(k−1,l+1)−R(k+1,l+1)|  (5)

The variables i and j refer to the coordinates of the upper left sample in the 4×4 block. The summations of all calculated horizontal gradients g_(H), vertical gradients g_(V), 135 degree gradients g_(D1) and 45 degree gradients g_(D2) are calculated as:

$\begin{matrix} {{{g_{H} = {\sum\limits_{k = {i - 2}}^{i + 5}\;{\sum\limits_{l = {j - 2}}^{j + 5}\; H_{k,l}}}},{g_{V} = {\sum\limits_{k = {i - 2}}^{i + 5}\;{\sum\limits_{l = {j - 2}}^{j + 5}\; V_{k,l}}}}}{{g_{D\; 1} = {\sum\limits_{k = {i - 2}}^{i + 5}\;{\sum\limits_{l = {j - 2}}^{j + 5}{D\; 1_{k,l}}}}},{g_{D\; 2} = {\sum\limits_{k = {i - 2}}^{i + 5}\;{\sum\limits_{l = {j - 2}}^{j + 5}{D\; 2_{k,l}}}}}}} & (6) \end{matrix}$

The ratio of the maximum and the minimum of the horizontal and vertical gradients, denoted by R_(H,V), and the ratio of the maximum and the minimum of the two diagonal gradients, denoted by R_(D1,D2), are calculated as shown below in equation (7).

R _(H,V)=max(g _(H) ,g _(V))/min(g _(H) ,g _(V))

R _(D1,D2)=max(g _(D1) ,g _(D2))/min(g _(D1) ,g _(D2))  (7)

Then, R_(H,V) and R_(D1,D2), are compared against each other with two thresholds, t₁=2 and t₂=4.5, to derive the directionality D, as follows:

Step 1: If both R_(H,V)≤t₁ and R_(D1,D2)<t₁, D is set to 0 (texture), otherwise continue with Step 2.

Step 2: If R_(D1,D2)>R_(H,V), continue with Step 3, otherwise continue with Step 4.

Step 3: If R_(D1,D2)≤t₂, D is set to 1 (weak diagonal), otherwise, D is set to 2 (strong diagonal).

Step 4: If R_(H,V)≤t₂, D is set to 3 (weak horizontal/vertical), otherwise, D is set to 4 (strong horizontal/vertical).

The activity value A is calculated as:

$\begin{matrix} {A = {\left( {\sum\limits_{k = {i - 2}}^{i + 5}\;{\sum\limits_{l = {j - 2}}^{j + 5}\left( {V_{k,l} + H_{k,l}} \right)}} \right)\mspace{14mu}\text{>>}\mspace{14mu}\left( {{BD} - 2} \right)}} & (8) \end{matrix}$

A is further mapped to the range of 0 to 4, inclusive, and the quantized value is denoted as Â. Therefore, each 4×4 block is categorized into one of 25 classes (C) as:

C=5D+Â  (9)

Therefore, a luma filter set contains 25 filters. However, to reduce the number of bits required to represent the filter coefficients while maintaining the coding efficiency, different classes can be merged. The merged classes use the same filters. Video encoder 200 may signal a merging table. In merging table 414, a filter index of each class is signaled by using a fixed-length code, as is illustrated in FIG. 5, as an example. FIG. 5 shows an example of merging 25 luma classes into 7 merged classes, where each square represents a class (index can be from 0 to 24, inclusive) based on the value of D and Â. In this example filter set, video encoder 200 may be configured to signal 7 luma filters. For each class, video encoder 200 may signal the filter index (from 0 to 6 in this example) in an ALF_APS (adaptation parameter set).

Once obtaining a filter from a luma filter set based on class index C of a 4×4 block and the merging table, before obtaining the filter samples of that block, a simple geometric transformation, as illustrated in FIG. 6, can be applied to the filter depending on the gradient values calculated for the 4×4 block as in Table 1.

TABLE 1 Geometric transformation based on gradient values Gradient values Transformation g_(D1) < g_(D1) and g_(H) < g_(V) No transformation g_(D2) < g_(D1) and g_(V) ≤ g_(H) Diagonal flip g_(D1) ≤ g_(D2) and g_(H) < g_(V) Vertical flip g_(D1) ≤ g_(D2) and g_(V) ≤ g_(H) Right rotation

FIG. 6 illustrates geometric transformations of a 7×7 diamond filter shape. The geometric transformations include a diagonal flip 416, a vertical flip 418, and a right rotation 420.

Coding Tree Block Level Adaptation

In JEM-7.0, only one luma filter set is applied to all luma CTBs of a slice and only one chroma filter is applied to all chroma CTBs of a slice. However, there are two disadvantages. First, when statistical information among CTBs differs substantially, using the same filter/filter set for all CTBs of a color component may limit the coding efficiency of ALF, especially for large resolution sequences and mixed content video sequences (e.g., both natural content and screen content). Secondly, when deriving a filter for a slice, a filter cannot be calculated until the statistical information of the entire slice is collected. This multiple-pass encoding technique may not be suitable for low-delay applications. To address this problem, one example solution uses statistics from previously coded slices. However, this may cause some performance loss.

In addition to luma 4×4 block level filter adaptation, VVC supports CTB level filter adaption. In a slice, video encoder 200 may be configured to use different luma filter sets for different luma CTBs, and may also use different chroma filters for different chroma CTBs. Video encoder 200 may use the same filters for CTBs with similar statistics. This CTB level filter adaptation improves coding efficiency, especially for low-delay applications. In addition, VVC version 1 allows video encoder 200 to use filters from previously coded pictures for a CTB. This temporal filter re-usage mechanism can reduce the overhead of filter coefficients. In VVC version 1, up to seven signaled luma filter sets and eight signaled chroma filters can be applied to a slice. When there are not any signaled filters, one of 16 fixed filter sets can be applied to a luma CTB.

When ALF is enabled, the filter set index of either a fixed filter set or a signaled luma filter set is signaled for a luma CTB. The filter index of a signaled chroma filter is signaled for a chroma CTB. By using filters signaled from previously coded pictures, as well as fixed filters, when encoding a current CTU in a low delay application, three CTU-level on/off flags and filter/filter set indices can be decided by only using the statistics information of the current CTU. Therefore, the encoded bitstream of each CTU can be generated on the fly instead of waiting for the availability of the statistics of the whole picture.

Line Buffer Reduction

As shown in FIG. 2, in the vertical direction, the filter shapes have 7 taps and 5 taps for luma and chroma components, respectively. As a result, in VVC Test Model 2.0 (VTM-2.0), when decoding a row of CTUs, due to the delay of the deblocking filter and SAO filter, 7 luma lines and 4 chroma lines of the upper CTU row must be stored in a line buffer for ALF. However, the extra line buffers require large chip areas, especially for high-definition (HD) and ultra-high-definition (UHD) video sequences.

To make ALF hardware friendly (e.g., by reducing line buffer requirements), the concept of a virtual boundary (VB) may be applied to remove all the line buffer overhead for ALF. Considering the deblocking filter and SAO filter in VVC version 1, the position of a VB is 4 luma samples and 2 chroma samples above a horizontal CTU boundary. When one sample on one side of a VB is filtered, the samples on the other side of the VB cannot be utilized. Modified filtering with symmetrical sample padding is applied, as is shown in the examples of FIGS. 7-9, where the center square of filter 432 is the position of a current, to-be-filtered sample and the bold line 430 is the position of a VB. In FIGS. 7-9 the filter tap locations with dashed lines are padded. FIG. 7 shows an example where one filter tap location of filter 432 is above or below VB 430. In this example, one filter tap location is padded. FIG. 8 shows an example where four filter tap locations of filter 432 are above or below VB 430. In this example, four filter tap locations are padded.

However, when a sample is on the closest row on each side of VB 430, e.g., as shown in FIG. 9, the 2D filter is equivalent to a horizontal filter. This may introduce visual artifacts. To address that problem, the filter strength is compensated when the current, to-be-filtered sample is on the closest row on each side of a VB, as shown in equation (10). Comparing equation (10) with equation (2), 3 more bits are right shifted.

$\begin{matrix} {{\overset{\sim}{R}\left( {x,y} \right)} = {{R\left( {x,y} \right)} + {\left\lbrack {{\sum\limits_{i = 0}^{N - 2}\;{c_{i}\left( {f_{i,0} + f_{i,1}} \right)}} + 512} \right\rbrack\mspace{14mu}\text{>>}\mspace{14mu} 10}}} & (10) \end{matrix}$

When VB processing is applied, classification of a 4×4 block is also modified. When calculating the class index of a 4×4 block on one side of a VB, the gradients and samples on the other side of the VB are not used, as shown in FIG. 10. However, when calculating gradient values of samples adjacent to a VB, the samples on the other side of the VB cannot be utilized. Therefore, the boundary samples of the current side are repetitively extended, as shown in FIG. 10. That is, the boundary samples on the current side of the VB are mirrored to the other side of the VB. Since the number of available gradient values is reduced, the activity derivation in equation (8) is re-scaled as:

$\begin{matrix} {A = {\left( {\sum\limits_{k = {i - 2}}^{i + 5}\;{\sum\limits_{l = {j - 2}}^{j + 5}{\left( {V_{k,l} + H_{k,l}} \right)*3}}} \right)\mspace{14mu}\text{>>}\mspace{14mu}\left( {{BD} - 1} \right)}} & (11) \end{matrix}$

Filter Coefficient Signaling

In VVC version 1, ALF coefficients are signaled in ALF adaptation parameter sets (APS). One APS may contain one set of luma filters (i.e., one luma filter set) with up to 25 filters, one set of chroma filters with up to 8 chroma filters, one set of Cb cross-component ALF (CC-ALF) filters with up to 4 filters, and one set of Cr CC-ALF filters with up to 4 filters. Each set of luma filters support applying ALF to the 25 classes for the luma component. In VVC version 1, up to 8 ALF APSs (e.g., designated as an ALF_APS) are supported.

Descriptor alf_data( ) { alf_luma_filter_signal_flag u(1) if( aps_chroma_present_flag ) { alf_chroma_filter_signal_flag u(1) alf_cc_cb_filter_signal_flag u(1) alf_cc_cr_filter_signal_flag u(1) } if( alf_luma_filter_signal_flag ) { alf_luma_clip_flag u(1) alf_luma_num_filters_signalled_minus1 ue(v) if( alf_luma_num_filters_signalled_minus1 > 0 ) for( filtIdx = 0; filtIdx < NumAlfFilters; filtIdx++ ) alf_luma_coeff_delta_idx[ filtIdx ] u(v) for( sfIdx = 0; sfIdx <= alf_luma_num_filters_signalled_minus1; sfIdx++ ) for( j = 0; j < 12;j++ ) { alf_luma_coeff_abs[ sfIdx ][ j ] ue(v) if( alf_luma_coeff_abs[ sfIdx ][ j ] ) alf_luma_coeff_sign[ sfIdx ][ j ] u(1) } if( alf_luma_clip_flag ) for( sfIdx = 0; sfIdx <= alf_luma_num_filters_signalled_minus1; sfIdx++ ) for( j = 0; j < 12; j++ ) alf_luma_clip_idx[ sfIdx ][ j ] u(2) } if( alf_chroma_filter_signal_flag ) { alf_chroma_clip_flag u(1) alf_chroma_num_alt_filters_minus1 ue(v) for( altIdx = 0; altIdx <= alf_chroma_num_alt_filters_minus1; altIdx++ ) { for( j = 0; j < 6; j++ ) { alf_chroma_coeff_abs[ altIdx ][ j ] ue(v) if( alf_chroma_coeff_abs[ altIdx ][ j ] > 0 ) alf_chroma_coeff_sign[ altIdx ][ j ] u(1) } if( alf_chroma_clip_flag ) for( j = 0; j < 6; j++ ) alf_chroma_clip_idx[ altIdx ][ j ] u(2) } } if( alf_cc_cb_filter_signal_flag ) { alf_cc_cb_filters_signalled_minus1 ue(v) for( k = 0; k < alf_cc_cb_filters_signalled_minus1 + 1; k++ ) { for( j = 0; j < 7; j++ ) { alf_cc_cb_mapped_coeff_abs[ k ][ j ] u(3) if( alf_cc_cb_mapped_coeff_abs[ k ][ j ] ) alf_cc_cb_coeff_sign[ k ][ j ] u(1) } } } if( alf_cc_cr_filter_signal_flag ) { alf_cc_cr_filters_signalled_minus1 ue(v) for( k = 0; k < alf_cc_cr_filters_signalled_minus1 + 1; k++ ) { for( j = 0; j < 7; j++ ) { alf_cc_cr_mapped_coeff_abs[ k ][ j ] u(3) if( alf_cc_cr_mapped_coeff_abs[ k ][ j ] ) alf_cc_cr_coeff_sign[ k ][ j ] u(1) } } } }

At the picture header and the slice header, video encoder 200 may signal the indices of ALF_APSs. One slice may support up to 7 ALF_APSs for luma components, up to 1 ALF_APS for chroma ALF, up to 1 ALF_APS for Cb CC-ALF, and up to 1 ALF_APS for Cr CC-ALF.

if( sh_alf_enabled_flag ) { sh_num_alf_aps_ids_luma u(3) for( i = 0; i < sh_num_alf_aps_ids_luma; i++ ) sh_alf_aps_id_luma[ i ] u(3) if( sps_chroma_format_idc != 0 ) { sh_alf_cb_enabled_flag u(1) sh_alf_cr_enabled_flag u(1) } if( sh_alf_cb_enabled_flag ∥ sh_alf_cr_enabled_flag ) sh_alf_aps_id_chroma u(3) if( sps_ccalf_enabled_flag ) { sh_cc_alf_cb_enabled_flag u(1) if( sh_cc_alf_cb_enabled_flag ) sh_cc_alf_cb_aps_id u(3) sh_cc_alf_cr_enabled_flag u(1) if( sh_cc_alf_cr_enabled_flag ) sh_cc_alf_cr_aps_id u(3) } }

At the luma CTB level, the filter set index (ALF_APS or fixed filter set) is signaled.

if( alf_ctb_flag[ 0 ][ CtbAddrX ][ CtbAddrY ] ) { if( sh_num_alf_aps_ids_luma > 0 ) alf_use_aps_flag ae(v) if( alf_use_aps_flag ) { if( sh_num_alf_aps_ids_luma > 1 ) alf_luma_prev_filter_idx ae(v) } else alf_luma_fixed_filter_idx ae(v) }

At the chroma CTB level, the ALF and CCALF filter index in the ALF_APS is signaled.

if( sh_alf_cb_enabled_flag ) { alf_ctb_flag[ 1 ][ CtbAddrX ][ CtbAddrY ] ae(v) if( alf_ctb_flag[ 1 ][ CtbAddrX ][ CtbAddrY ] && alf_chroma_num_alt_filters_minus1 > 0 ) alf_ctb_filter_alt_idx[ 0 ][ CtbAddrX ][ ae(v) CtbAddrY ] } if( sh_alf_cr_enabled_flag ) { alf_ctb_flag[ 2 ][ CtbAddrX ][ CtbAddrY ] ae(v) if( alf_ctb_flag[ 2 ][ CtbAddrX ][ CtbAddrY ] && alf_chroma_num_alt_filters_minus1 > 0 ) alf_ctb_filter_alt_idx[ 1 ][ CtbAddrX ][ ae(v) CtbAddrY ] } if( sh_cc_alf_cb_enabled_flag ) alf_ctb_cc_cb_idc[ CtbAddrX ][ CtbAddrY ] ae(v) if( sh_cc_alf_cr_enabled_flag ) alf_ctb_cc_cr_idc[ CtbAddrX ][ CtbAddrY ] ae(v)

The number of total ALF_APSs is limited in VVC, which may not be efficient for high resolution sequences or sequences with mixed content. That is, because the total number of ALF_APSs is limited, and that the number of filter sets in each ALF is limited, a video encoder may not be able to determine to use the best ALF for all regions in a complex video picture or sequence.

ALF_APS

This disclosure describes the following techniques to further improve the coding efficiency of ALF, particularly for high resolution sequences, such as 1080P, 4K and 8K sequences. In one example of the disclosure, video encoder 200 and video decoder 300 may be configured to code (e.g., encode and decode, respectively) an ALF_APS that includes multiple luma ALF filter sets, chroma ALF filters sets, and/or CC-ALF filter sets.

For example, video encoder 200 may encode multiple ALF filters sets in one or more APSs. Video encoder 200 may encode a syntax element that indicates to video decoder which APS to use for a particular picture or sub-picture. In this context a sub-picture may be a smaller region of a picture, including a tile, tile group, brick, slice, coding tree block or other block. Video encoder 200 may also encode a syntax element that indicates which ALF filter set of the multiple ALF filter sets to use for the particular sub-picture or sub-picture. Video decoder 300 may receive the multiple adaptive loop filter sets in an adaptation parameter set associated with video data, determine one or more adaptive loop filters from the multiple adaptive loop filter sets, and apply the determined one or more adaptive loop filters to the video data.

For example, video decoder 300 may decode, for a coding tree block, a filter set index that indicates a particular adaptive loop filter set of the multiple adaptive loop filter sets in the adaptation parameter set. Video decoder 300 may be further configured to decode, for the coding tree block, a filter index that indicates a particular adaptive loop filter from the particular adaptive loop filter set, and then apply the particular adaptive loop filter to the coding tree block. Video decoder 300 may also be configured to decode, for the coding tree block of the video data, an adaptation parameter set index that indicates the adaptation parameter set.

In one example, for each color component, video decoder 300 may be configured to share the same clipping flag for all the filter sets. Below is an example syntax structure for one example technique of the disclosure. Relative to VVC, the example syntax of this disclosure includes an alf_luma_num_filter_set_minus 1 syntax element that specifies the number of adaptive loop filter sets for luma coefficients which can be signalled. Likewise, the sytnax may include a syntax element that indicates the number of adaptive loop filter sets for chroma components (alf_chroma_num_filter_set_minus1) and the number of filter sets for CC-ALF (alf_cc_cb_num_filter_set_minus1 and alf_cc_cr_num_filter_set_minus1). In addition, the syntax includes a syntax element (filterSetIdx) that indicates the particular filter set of the multiple filter sets.

Descriptor alf_data( ) { alf_luma_filter_signal_flag u(1) if( aps_chroma_present_flag ) { alf_chroma_filter_signal_flag u(1) alf_cc_cb_filter_signal_flag u(1) alf_cc_cr_filter_signal_flag u(1) } if( alf_luma_filter_signal_flag ) { alf_luma_num_filter_set_minus1 ue(v) alf_luma_clip_flag u(1) for( filterSetIdx = 0; filterSetIdx <= alf_luma_num_filter_set_minus1; filterSetIdx++){ alf_luma_num_filters_signalled_minus1[filterSetIdx] ue(v) if( alf_luma_num_filters_signalled_minus1[filterSetIdx] > 0 ) for( filtIdx = 0; filtIdx < NumAlfFilters; filtIdx++ ) alf_luma_coeff_delta_idx[filterSetIdx][ filtIdx ] u(v) for( sfIdx = 0; sfIdx <= alf_luma_num_filters_signalled_minus1[filterSetIdx]; sfIdx++ ) for( j = 0; j < 12; j++ ) { alf_luma_coeff_abs[filterSetIdx] [ sfIdx ][ j ] ue(v) if( alf_luma_coeff_abs[filterSetIdx] [ sfIdx ][ j ] ) alf_luma_coeff_sign[filterSetIdx] [ sfIdx ][ j ] u(1) } if( alf_luma_clip_flag ) for( sfIdx = 0; sfIdx <= alf_luma_num_filters_signalled_minus1[filterSetIdx]; sfIdx++ ) for( j = 0; j < 12; j++ ) alf_luma_clip_idx[filterSetIdx] [ sfIdx ][ j ] u(2) } } if( alf_chroma_filter_signal_flag ) { alf_chroma_num_filter_set_minus1 ue(v) alf_chroma_clip_flag u(1) for( filterSetIdx = 0; filterSetIdx <= alf_chroma_num_filter_set_minus1; filterSetIdx++){ alf_chroma_num_alt_filters_minus1[filterSetIdx] ue(v) for( altIdx = 0; altIdx <= alf_chroma_num_alt_filters_minus1[filterSetIdx]; altIdx++ ) { for( j = 0; j < 6; j++ ) { alf_chroma_coeff_abs[filterSetIdx] [ altIdx ][ j ] ue(v) if( alf_chroma_coeff_abs[filterSetIdx] [ altIdx ][ j ] > 0 ) alf_chroma_coeff_sign[filterSetIdx] [ altIdx ][ j ] u(1) } if( alf_chroma_clip_flag ) for( j = 0; j < 6; j++ ) alf_chroma_clip_idx[filterSetIdx] [ altIdx ][ j ] u(2) } } } if( alf_cc_cb_filter_signal_flag ) { alf_cc_cb_num_filter_set_minus1 ue(v) for( filterSetIdx = 0; filterSetIdx <= alf_cc_cb_num_filter_set_minus1; filterSetIdx++){ alf_cc_cb_filters_signalled_minus1[filterSetIdx] ue(v) for( k = 0; k < alf_cc_cb_filters_signalled_minus1[filterSetIdx] + 1; k++ ) { for( j = 0; j < 7; j++ ) { alf_cc_cb_mapped_coeff_abs[filterSetIdx] [ k ][ j ] u(3) if( alf_cc_cb_mapped_coeff_abs[filterSetIdx] [ k ][ j ] ) alf_cc_cb_coeff_sign[filterSetIdx] [ k ][ j ] u(1) } } } } if( alf_cc_cr_filter_signal_flag ) { alf_cc_cr_num_filter_set_minus1 ue(v) for( filterSetIdx = 0; filterSetIdx <= alf_cc_cr_num_filter_set_minus1; filterSetIdx++){ alf_cc_cr_filters_signalled_minus1[filterSetIdx] ue(v) for( k = 0; k < alf_cc_cr_filters_signalled_minus1[filterSetIdx] + 1; k++ ) { for( j = 0; j < 7; j++ ) { alf_cc_cr_mapped_coeff_abs[filterSetIdx] [ k ][ j ] u(3) if( alf_cc_cr_mapped_coeff_abs[filterSetIdx] [ k ][ j ] ) alf_cc_cr_coeff_sign[filterSetIdx] [ k ][ j ] u(1) } } } } } }

In the above example, video decoder 300 may be configured to decode a clipping flag that is applicable for all adaptive loop filter sets of the multiple adaptive loop filter sets for luma components, and decode a clipping flag that is applicable for all adaptive loop filter sets of the multiple adaptive loop filter sets for chroma components.

In the example below, video decoder 300 may be configured to decode a respective clipping flag for each adaptive loop filter set of the multiple adaptive loop filter sets for luma components, and decode a respective clipping flag for each adaptive loop filter set of the multiple adaptive loop filter sets for chroma components. In this example, for each color component, each filter set may have its own clipping flag. As shown below, the alf_luma_clip flag and alf_chroma_clip_flag are removed. Instead, each particular filter set has its own clipping flag, as indicated by alf_luma_clip_flag[filterSetIdx] and alf_chroma_clip_flag[filterSetIdx].

Descriptor alf_data( ) { alf_luma_filter_signal_flag u(1) if( aps_chroma_present_flag ) { alf_chroma_filter_signal_flag u(1) alf_cc_cb_filter_signal_flag u(1) alf_cc_cr_filter_signal_flag u(1) } if( alf_luma_filter_signal_flag ) { alf_luma_num_filter_set_minus1 ue(v) <removed> alf_luma_clip_flag</removed> u(1) for( filterSetIdx = 0; filterSetIdx <= alf_luma_num_filter_set_minus1; filterSetIdx++){ alf_luma_clip_flag[filterSetIdx] u(1) alf_luma_num_filters_signalled_minus1[filterSetIdx] ue(v) if( alf_luma_num_filters_signalled_minus1[filterSetIdx] > 0 ) for( filtIdx = 0; filtIdx < NumAlfFilters; filtIdx++ ) alf_luma_coeff_delta_idx[filterSetIdx][ filtIdx ] u(v) for( sfIdx = 0; sfIdx <= alf_luma_num_filters_signalled_minus1[filterSetIdx]; sfIdx++ ) for( j = 0; j < 12; j++ ) { alf_luma_coeff_abs[filterSetIdx] [ sfIdx ][ j ] ue(v) if( alf_luma_coeff_abs[filterSetIdx] [ sfIdx ][ j ] ) alf_luma_coeff_sign[filterSetIdx] [ sfIdx ][ j ] u(1) } if( alf_luma_clip_flag[filterSetIdx] ) for( sfIdx = 0; sfIdx <= alf_luma_num_filters_signalled_minus1[filterSetIdx]; sfIdx++ ) for( j = 0; j < 12; j++ ) alf_luma_clip_idx[filterSetIdx] [ sfIdx ][ j ] u(2) } } if( alf_chroma_filter_signal_flag ) { alf_chroma_num_filter_set_minus1 ue(v) <removed>alf_chroma_clip_flag</removed>

for( filterSetIdx = 0; filterSetIdx <= alf_chroma_num_filter_set_minus1; filterSetIdx++){ alf_chroma_clip_flag[filterSetIdx] u(1) alf_chroma_num_alt_filters_minus1[filterSetIdx] ue(v) for( altIdx = 0; altIdx <= alf_chroma_num_alt_filters_minus1[filterSetIdx]; altIdx++ ) { for( j = 0; j < 6; j++ ) { alf_chroma_coeff_abs[filterSetIdx] [ altIdx ][ j ] ue(v) if( alf_chroma_coeff_abs[filterSetIdx] [ altIdx ][ j ] > 0 ) alf_chroma_coeff_sign[filterSetIdx] [ altIdx ][ j ] u(1) } if( alf_chroma_clip_flag[filterSetIdx] ) for( j = 0; j < 6; j++ ) alf_chroma_clip_idx[filterSetIdx] [ altIdx ][ j ] u(2) } } } if( alf_cc_cb_filter_signal_flag ) { alf_cc_cb_num_filter_set_minus1 ue(v) for( filterSetIdx = 0; filterSetIdx <= alf_cc_cb_num_filter_set_minus1; filterSetIdx++){ alf_cc_cb_filters_signalled_minus1[filterSetIdx] ue(v) for( k = 0; k < alf_cc_cb_filters_signalled_minus1[filterSetIdx] + 1; k++ ){ for( j = 0; j < 7; j++ ) { alf_cc_cb_mapped_coeff_abs[filterSetIdx] [ k ][ j ] u(3) if( alf_cc_cb_mapped_coeff_abs[filterSetIdx] [ k ][ j ] ) alf_cc_cb_coeff_sign[filterSetIdx] [ k ][ j ] u(1) } } } } if( alf_cc_cr_filter_signal_flag ) { alf_cc_cr_num_filter_set_minus1 ue(v) for( filterSetIdx = 0; filterSetIdx <= alf_cc_cr_num_filter_set_minus1; filterSetIdx++){ alf_cc_cr_filters_signalled_minus1[filterSetIdx] ue(v) for( k = 0; k < alf_cc_cr_filters_signalled_minus1[filterSetIdx] + 1; k++ ) { for( j = 0; j < 7; j++ ) { alf_cc_cr_mapped_coeff_abs[filterSetIdx] [ k ][ j ] u(3) if( alf_cc_cr_mapped_coeff_abs[filterSetIdx] [ k ][ j ] ) alf_cc_cr_coeff_sign[filterSetIdx] [ k ][ j ] u(1) } } } } }

The semantics of the syntax elements shown above are described below.

alf_luma_num_filter_set_minus1 plus 1 specifies the number of adaptive loop filter sets for which luma coefficients can be signalled.

alf_luma_clip_flag[filterSetIdx] equal to 0 specifies that linear adaptive loop filtering is applied on luma component with filter set identified by filterSetIdx. alf_luma_clip_flag[filterSetIdx] equal to 1 specifies that non-linear adaptive loop filtering may be applied on luma component with filter set identified by filterSetIdx.

alf_luma_num_filters_signalled_minus1[filterSetIdx] plus 1 specifies the number of adaptive loop filter classes for which luma coefficients can be signalled with filter set identified by filterSetIdx. The value of alf_luma_num_filters_signalled_minus1 shall be in the range of 0 to NumAlfFilters−1, inclusive.

alf_luma_coeff_delta_idx[filterSetIdx][filtIdx] specifies the indices of the signalled adaptive loop filter luma coefficient deltas for the filter class indicated by filtIdx ranging from 0 to NumAlfFilters−1 with filter set identified by filterSetIdx. When alf_luma_coeff_delta_idx[filterSetIdx][filtIdx] is not present, it is inferred to be equal to 0. The length of alf_luma_coeff_delta_idx[filterSetIdx][filtIdx] is Ceil(Log2(alf_luma_num_filters_signalled_minus1+1)) bits. The value of alf_luma_coeff_delta_idx[filterSetIdx][filtIdx] shall be in the range of 0 to alf_luma_num_filters_signalled_minus1, inclusive.

alf_luma_coeff_abs[filterSetIdx][sfIdx][j] specifies the absolute value of the j-th coefficient of the signalled luma filter indicated by sfIdx1 with filter set identified by filterSetIdx. When alf_luma_coeff_abs[filterSetIdx][sfIdx][j] is not present, it is inferred to be equal 0. The value of alf_luma_coeff_abs[filterSetIdx][sfIdx][j] shall be in the range of 0 to 128, inclusive.

alf_luma_coeff_sign[filterSetIdx][sfIdx][j] specifies the sign of the j-th luma coefficient of the filter indicated by sfIdx 1 with filter set identified by filterSetIdx as follows:

-   -   If alf_luma_coeff_sign[filterSetIdx][sfIdx][j] is equal to 0,         the corresponding luma filter coefficient has a positive value.     -   Otherwise (alf_luma_coeff_sign[filterSetIdx][sfIdx][j] is equal         to 1), the corresponding luma filter coefficient has a negative         value.         When alf_luma_coeff_sign[filterSetIdx][sfIdx][j] is not present,         it is inferred to be equal to 0.         The variable filtCoeff[filterSetIdx][sfIdx][j] with         filterSetIdx=0 . . . alf_luma_num_filter_set_minus1, sfIdx=0 . .         . alf_luma_num_filters_signalled_minus1, j=0 . . . 11 is         initialized as follows:

filtCoeff[filterSetIdx][sfIdx][j]=alf_luma_coeff_abs[sfIdx][j]*(1−2*alf_luma_coeff_sign[sfIdx][j])  (94)

The luma filter coefficients AlfCoeff_(L)[aps_adaptation_parameter_set_id] with elements AlfCoeff_(L)[aps_adaptation_parameter_set_id][filterSetIdx][filtIdx][j], with filterSetIdx=0 . . . alf_luma_num_filter_set_minus1, filtIdx=0 . . . NumAlfFilters−1 and j=0 . . . 11 are derived as follows:

AlfCoeff_(L)[aps_adaptation_parameter_set_id][filterSetIdx][filtIdx][j]=filtCoeff[alf_luma_coeff_delta_idx[filtIdx]][j]  (95)

It is a requirement of bitstream conformance that the values of AlfCoeff_(L)[aps_adaptation_parameter_set_id][filterSetIdx][filtIdx][j] with filtIdx=0 . . . NumAlfFilters−1, j=0 . . . 11 shall be in the range of −2⁷ to 2⁷−1, inclusive.

alf_luma_clip_idx[filterSetIdx][sfIdx][j] specifies the clipping index of the clipping value to use before multiplying by the j-th coefficient of the signaled luma filter indicated by sfIdx with filter set identified by filterSetIdx. It is a requirement of bitstream conformance that the values of alf_luma_clip_idx[filterSetIdx][sfIdx][j] with sfIdx=0 . . . alf_luma_num_filters_signalled_minus1 and j=0 . . . 11 shall be in the range of 0 to 3, inclusive.

The luma filter clipping values AlfClip_(L)[aps_adaptation_parameter_set_id] with elements AlfClip_(L)[aps_adaptation_parameter_set_id][filterSetIdx][filtIdx][j], with filterSetIdx=0 . . . alf_luma_num_filter_set_minus1, filtIdx=0 . . . NumAlfFilters−1 and j=0 . . . 11 are derived as specified in Table 8 below depending on BitDepth and clipIdx set equal to alf_luma_clip_idx[filterSetIdx] [alf_luma_coeff_delta_idx[filtIdx]][j].

alf_chroma_num_filter_set_minus1 plus 1 specifies the number of adaptive loop filter sets for which chroma coefficients can be signalled.

alf_chroma_clip_flag[filterSetIdx] equal to 0 specifies that linear adaptive loop filtering is applied on chroma components with filter set identified by filterSetIdx;

alf_chroma_clip_flag[filterSetIdx] equal to 1 specifies that non-linear adaptive loop filtering is applied on chroma components with filter set identified by filterSetIdx. When not present, alf_chroma_clip_flag[filterSetIdx] is inferred to be equal to 0.

alf_chroma_num_alt_filters_minus1[filterSetIdx] plus 1 specifies the number of alternative filters for chroma components with filter set identified by filterSetIdx. The value of alf_chroma_num_alt_filters_minus1[filterSetIdx] shall be in the range of 0 to 7, inclusive.

alf_chroma_coeff_abs[filterSetIdx][altIdx][j] specifies the absolute value of the j-th chroma filter coefficient for the alternative chroma filter with index altIdx with filter set identified by filterSetIdx. When alf_chroma_coeff_abs[filterSetIdx][altIdx][j] is not present, it is inferred to be equal 0. The value of alf_chroma_coeff_abs[filterSetIdx][sfIdx][j] shall be in the range of 0 to 128, inclusive.

alf_chroma_coeff_sign[filterSetIdx][altIdx][j] specifies the sign of the j-th chroma filter coefficient for the alternative chroma filter with index altIdx as follows:

-   -   If alf_chroma_coeff_sign[filterSetIdx][altIdx][j] is equal to 0,         the corresponding chroma filter coefficient has a positive         value.     -   Otherwise (alf_chroma_coeff_sign[filterSetIdx][altIdx][j] is         equal to 1), the corresponding chroma filter coefficient has a         negative value.         When alf_chroma_coeff_sign[filterSetIdx][altIdx][j] is not         present, it is inferred to be equal to 0.         The chroma filter coefficients         AlfCoeffc[aps_adaptation_parameter_set_id]         [filterSetIdx][altIdx] with elements         AlfCoeffc[aps_adaptation_parameter_set_id][filterSetIdx][altIdx][j],         with filterSetIdx=0 . . . alf_chroma_num_filter_set_minus1,         altIdx=0 . . . alf_chroma_num_alt_filters_minus1, j=0 . . . 5         are derived as follows:

AlfCoeffc[aps_adaptation_parameter_set_id][filterSetIdx][altIdx][j]=alf_chroma_coeff_abs[filterSetIdx][altIdx][j]*(1−2*alf_chroma_coeff_sign[filterSetIdx][altIdx][j])  (98)

It is a requirement of bitstream conformance that the values of AlfCoeffc[aps_adaptation_parameter_set_id][filterSetIdx][altIdx][j] with filterSetIdx=0 . . . alf_chroma_num_filter_set_minus1 altIdx=0 . . . alf_chroma_num_alt_filters_minus1, j=0 . . . 5 shall be in the range of −2⁷ to 2⁷−1, inclusive.

alf_chroma_clip_idx[filterSetIdx][altIdx][j] specifies the clipping index of the clipping value to use before multiplying by the j-th coefficient of the alternative chroma filter with index altIdx with filter set identified by filterSetIdx. It is a requirement of bitstream conformance that the values of alf_chroma_clip_idx[filterSetIdx][altIdx][j] with filterSetIdx=0 . . . alf_chroma_num_filter_set_minus_1, altIdx=0 . . . alf_chroma_num_alt_filters_minus1, j=0 . . . 5 shall be in the range of 0 to 3, inclusive.

The chroma filter clipping values AlfClipc[aps_adaptation_parameter_set_id][filterSetIdx][altIdx] with elements AlfClipc[aps_adaptation_parameter_set_id][filterSetIdx][altIdx][j], with filterSetIdx=0 . . . alf_chroma_num_filter_set_minus1, altIdx=0 . . . alf_chroma_num_alt_filters_minus1, j=0 . . . 5 are derived as specified in Table 8 depending on BitDepth and clipIdx set equal to alf_chroma_clip_idx[filterSetIdx][altIdx][j].

TABLE 8 Specification AlfClip depending on BitDepth and clipIdx clipIdx BitDepth 0 1 2 3 8 2⁸  2⁵  2³ 2¹ 9 2⁹  2⁶  2⁴ 2² 10 2¹⁰ 2⁷  2⁵ 2³ 11 2¹¹ 2⁸  2⁶ 2⁴ 12 2¹² 2⁹  2⁷ 2⁵ 13 2¹³ 2¹⁰ 2⁸ 2⁶ 14 2¹⁴ 2¹¹ 2⁹ 2⁷ 15 2¹⁵ 2¹²  2¹⁰ 2⁸ 16 2¹⁶ 2¹³  2¹¹ 2⁹

alf_cc_cb_num_filter_set_minus1 plus 1 specifies the number of cross-component filter sets for Cb colour component signalled in the current ALF_APS.

alf_cc_cb_filters_signalled_minus1[filterSetIdx] plus 1 specifies the number of cross-component filters for the Cb colour component signaled in the current ALF_APS with filter set identified by filterSetIdx. The value of alf_cc_cb_filters_signalled_minus1[filterSetIdx] shall be in the range of 0 to 3, inclusive.

alf_cc_cb_mapped_coeff_abs[filterSetIdx][k][j] specifies the absolute value of the j-th mapped coefficient of the signaled k-th cross-component filter with filter set identified by filterSetIdx for the Cb colour component. When alf_cc_cb_mapped_coeff_abs[filterSetIdx][k][j] is not present, it is inferred to be equal to 0.

alf_cc_cb_coeff_sign[filterSetIdx][k][j] specifies the sign of the j-th coefficient of the signalled k-th cross-component filter with filter set identified by filterSetIdx for the Cb colour component as follows:

-   -   If alf_cc_cb_coeff_sign[filterSetIdx][k][j] is equal to 0, the         corresponding cross-component filter coefficient has a positive         value.     -   Otherwise (alf_cc_cb_sign[filterSetIdx][k][j] is equal to 1),         the corresponding cross-component filter coefficient has a         negative value.         When alf_cc_cb_coeff_sign[filterSetIdx][k][j] is not present, it         is inferred to be equal to 0.         The signalled k-th cross-component filter coefficients for the         Cb colour component         CcAlfApsCoeff_(Cb)[aps_adaptation_parameter_set_id][filterSetIdx][k][j],         with j=0 . . . 6 are derived as follows:     -   If alf_cc_cb_mapped_coeff_abs[filterSetIdx][k][j] is equal to 0,         CcAlfApsCoeff_(Cb)[aps_adaptation_parameter_set_id][filterSetIdx][k][j]         is set equal to 0.     -   Otherwise, CcAlfApsCoeff_(Cb)[aps_adaptation_parameter_set_id]         [filterSetIdx][k][j] is set equal to         (1−2*alf_cc_cb_coeff_sign[filterSetIdx]         [k][j])*2^(alf_cc_cb_mapped_coeff_abs[filterSetIdx][k][j]−1).

alf_cc_cr_num_filter_set_minus1 plus 1 specifies the number of cross-component filter sets for Cr colour component signalled in the current ALF APS.

alf_cc_cr_filters_signalled_minus1[filterSetIdx] plus 1 specifies the number of cross-component filters for the Cr colour component signaled in the current ALF APS with filter set identified by filterSetIdx. The value of alf_cc_cr_filters_signalled_minus1[filterSetIdx] shall be in the range of 0 to 3, inclusive.

alf_cc_cr_mapped_coeff_abs[filterSetIdx][k][j] specifies the absolute value of the j-th mapped coefficient of the signaled k-th cross-component filter with filter set identified by filterSetIdx for the Cr colour component. When alf_cc_cr_mapped coeff_abs[filterSetIdx][k][j] is not present, it is inferred to be equal to 0.

alf_cc_cr_coeff_sign[filterSetIdx][k][j] specifies the sign of the j-th coefficient of the signalled k-th cross-component filter with filter set identified by filterSetIdx for the Cr colour component as follows:

-   -   If alf_cc_cr_coeff_sign[filterSetIdx][k][j] is equal to 0, the         corresponding cross-component filter coefficient has a positive         value.     -   Otherwise (alf_cc_cr_sign[filterSetIdx][k][j] is equal to 1),         the corresponding cross-component filter coefficient has a         negative value.         When alf_cc_cr_coeff_sign[filterSetIdx][k][j] is not present, it         is inferred to be equal to 0.         The signalled k-th cross-component filter coefficients for the         Cr colour component         CcAlfApsCoeff_(Cr)[aps_adaptation_parameter_set_id][filterSetIdx][k][j],         with j=0 . . . 6 are derived as follows:     -   If alf_cc_cr_mapped coeff_abs[filterSetIdx][k][j] is equal to 0,         CcAlfApsCoeff_(Cr)[aps_adaptation_parameter_set_id][filterSetIdx][k][j]         is set equal to 0.     -   Otherwise, CcAlfApsCoeff_(Cr)[aps_adaptation_parameter_set_id]         [filterSetIdx][k][j] is set equal to         (1−2*alf_cc_cr_coeff_sign[filterSetIdx][k][j])*2^(alf_cc_cr_mapped_coeff_abs[filterSetIdx][k][j]−1).

CTB Level

At the CTB level, once the ALF_APS index is signaled and determined for the CTB, the filter set index may be signaled if the ALF_APS has multiple filter sets for the color component or if multiple filter sets in that ALF_APS are used for the color component. After signaling the filter set index, the filter index may be signaled if that filter set has multiple filters.

In this example, video decoder 300 may be configured to decode, for the coding tree block of the video data, an adaptation parameter set index that indicates the adaptation parameter set. Video decoder 300 may be further configured to decode, for a coding tree block, a filter set index that indicates a particular adaptive loop filter set of the multiple adaptive loop filter sets in the adaptation parameter set. Video decoder 300 may be further configured to decode, for the coding tree block, a filter index that indicates a particular adaptive loop filter from the particular adaptive loop filter set, and then apply the particular adaptive loop filter to the coding tree block.

Picture/Sub-Picture Header

At headers at a picture or sub-picture level (such as sub-picture, slice, tile, tile group, and/or brick), for each component, one picture/sub-picture may use all the filter sets in an ALF_APS. In another example, one picture/sub-picture may use one or some, but not all, filter sets and filters in an ALF_APS. The used filter sets and used filter index in each set may be signaled in a picture header and/or sub-picture header.

In one example, video decoder 300 may be configured to decode, at a picture header, one or more syntax elements that indicate which adaptive loop filter sets of the multiple adaptive loop filter sets are available for a picture of the video data, and apply the indicated adaptive loop filter sets to the picture of the video data. In another example, video decoder 300 may be configured to decode, at a sub-picture header, one or more syntax elements that indicate which adaptive loop filter sets of the multiple adaptive loop filter sets are available for a sub-picture of the video data, wherein the sub-picture includes a sub-picture, a slice, a tile, a tile group, or a brick of the video data, and apply the indicated adaptive loop filter sets to the sub-picture of the video data.

Region Information

A picture/sub-picture (such as sub-picture, slice, tile, tile group, and/or brick) may be partitioned into several regions. One region may have its own filter usage information of the ALF_APS, filter set and filter indices such that a video coder (e.g., video decoder 300) may only choose the filter that is defined by the usage information for samples in the region.

FIGS. 11A and 11B are conceptual diagrams illustrating an example quadtree binary tree (QTBT) structure 130, and a corresponding coding tree unit (CTU) 132. The solid lines represent quadtree splitting, and dotted lines indicate binary tree splitting. In each split (i.e., non-leaf) node of the binary tree, one flag is signaled to indicate which splitting type (i.e., horizontal or vertical) is used, where 0 indicates horizontal splitting and 1 indicates vertical splitting in this example. For the quadtree splitting, there is no need to indicate the splitting type, because quadtree nodes split a block horizontally and vertically into 4 sub-blocks with equal size. Accordingly, video encoder 200 may encode, and video decoder 300 may decode, syntax elements (such as splitting information) for a region tree level of QTBT structure 130 (i.e., the solid lines) and syntax elements (such as splitting information) for a prediction tree level of QTBT structure 130 (i.e., the dashed lines). Video encoder 200 may encode, and video decoder 300 may decode, video data, such as prediction and transform data, for CUs represented by terminal leaf nodes of QTBT structure 130.

In general, CTU 132 of FIG. 2B may be associated with parameters defining sizes of blocks corresponding to nodes of QTBT structure 130 at the first and second levels. These parameters may include a CTU size (representing a size of CTU 132 in samples), a minimum quadtree size (MinQTSize, representing a minimum allowed quadtree leaf node size), a maximum binary tree size (MaxBTSize, representing a maximum allowed binary tree root node size), a maximum binary tree depth (MaxBTDepth, representing a maximum allowed binary tree depth), and a minimum binary tree size (MinBTSize, representing the minimum allowed binary tree leaf node size).

The root node of a QTBT structure corresponding to a CTU may have four child nodes at the first level of the QTBT structure, each of which may be partitioned according to quadtree partitioning. That is, nodes of the first level are either leaf nodes (having no child nodes) or have four child nodes. The example of QTBT structure 130 represents such nodes as including the parent node and child nodes having solid lines for branches. If nodes of the first level are not larger than the maximum allowed binary tree root node size (MaxBTSize), then the nodes can be further partitioned by respective binary trees. The binary tree splitting of one node can be iterated until the nodes resulting from the split reach the minimum allowed binary tree leaf node size (MinBTSize) or the maximum allowed binary tree depth (MaxBTDepth). The example of QTBT structure 130 represents such nodes as having dashed lines for branches. The binary tree leaf node is referred to as a coding unit (CU), which is used for prediction (e.g., intra-picture or inter-picture prediction) and transform, without any further partitioning. As discussed above, CUs may also be referred to as “video blocks” or “blocks.”

In one example of the QTBT partitioning structure, the CTU size is set as 128×128 (luma samples and two corresponding 64×64 chroma samples), the MinQTSize is set as 16×16, the MaxBTSize is set as 64×64, the MinBTSize (for both width and height) is set as 4, and the MaxBTDepth is set as 4. The quadtree partitioning is applied to the CTU first to generate quad-tree leaf nodes. The quadtree leaf nodes may have a size from 16×16 (i.e., the MinQTSize) to 128×128 (i.e., the CTU size). If the quadtree leaf node is 128×128, the leaf quadtree node will not be further split by the binary tree, because the size exceeds the MaxBTSize (i.e., 64×64, in this example). Otherwise, the quadtree leaf node will be further partitioned by the binary tree. Therefore, the quadtree leaf node is also the root node for the binary tree and has the binary tree depth as 0. When the binary tree depth reaches MaxBTDepth (4, in this example), no further splitting is permitted. A binary tree node having a width equal to MinBTSize (4, in this example) implies that no further vertical splitting (that is, dividing of the width) is permitted for that binary tree node. Similarly, a binary tree node having a height equal to MinBTSize implies no further horizontal splitting (that is, dividing of the height) is permitted for that binary tree node. As noted above, leaf nodes of the binary tree are referred to as CUs, and are further processed according to prediction and transform without further partitioning.

FIG. 12 is a block diagram illustrating an example video encoder 200 that may perform the techniques of this disclosure. FIG. 12 is provided for purposes of explanation and should not be considered limiting of the techniques as broadly exemplified and described in this disclosure. For purposes of explanation, this disclosure describes video encoder 200 according to the techniques of VVC (ITU-T H.266, under development), and HEVC (ITU-T H.265). However, the techniques of this disclosure may be performed by video encoding devices that are configured to other video coding standards.

In the example of FIG. 12, video encoder 200 includes video data memory 230, mode selection unit 202, residual generation unit 204, transform processing unit 206, quantization unit 208, inverse quantization unit 210, inverse transform processing unit 212, reconstruction unit 214, filter unit 216, decoded picture buffer (DPB) 218, and entropy encoding unit 220. Any or all of video data memory 230, mode selection unit 202, residual generation unit 204, transform processing unit 206, quantization unit 208, inverse quantization unit 210, inverse transform processing unit 212, reconstruction unit 214, filter unit 216, DPB 218, and entropy encoding unit 220 may be implemented in one or more processors or in processing circuitry. For instance, the units of video encoder 200 may be implemented as one or more circuits or logic elements as part of hardware circuitry, or as part of a processor, ASIC, or FPGA. Moreover, video encoder 200 may include additional or alternative processors or processing circuitry to perform these and other functions.

Video data memory 230 may store video data to be encoded by the components of video encoder 200. Video encoder 200 may receive the video data stored in video data memory 230 from, for example, video source 104 (FIG. 1). DPB 218 may act as a reference picture memory that stores reference video data for use in prediction of subsequent video data by video encoder 200. Video data memory 230 and DPB 218 may be formed by any of a variety of memory devices, such as dynamic random access memory (DRAM), including synchronous DRAM (SDRAM), magnetoresistive RAM (MRAM), resistive RAM (RRAM), or other types of memory devices. Video data memory 230 and DPB 218 may be provided by the same memory device or separate memory devices. In various examples, video data memory 230 may be on-chip with other components of video encoder 200, as illustrated, or off-chip relative to those components.

In this disclosure, reference to video data memory 230 should not be interpreted as being limited to memory internal to video encoder 200, unless specifically described as such, or memory external to video encoder 200, unless specifically described as such. Rather, reference to video data memory 230 should be understood as reference memory that stores video data that video encoder 200 receives for encoding (e.g., video data for a current block that is to be encoded). Memory 106 of FIG. 1 may also provide temporary storage of outputs from the various units of video encoder 200.

The various units of FIG. 12 are illustrated to assist with understanding the operations performed by video encoder 200. The units may be implemented as fixed-function circuits, programmable circuits, or a combination thereof. Fixed-function circuits refer to circuits that provide particular functionality, and are preset on the operations that can be performed. Programmable circuits refer to circuits that can be programmed to perform various tasks, and provide flexible functionality in the operations that can be performed. For instance, programmable circuits may execute software or firmware that cause the programmable circuits to operate in the manner defined by instructions of the software or firmware. Fixed-function circuits may execute software instructions (e.g., to receive parameters or output parameters), but the types of operations that the fixed-function circuits perform are generally immutable. In some examples, one or more of the units may be distinct circuit blocks (fixed-function or programmable), and in some examples, one or more of the units may be integrated circuits.

Video encoder 200 may include arithmetic logic units (ALUs), elementary function units (EFUs), digital circuits, analog circuits, and/or programmable cores, formed from programmable circuits. In examples where the operations of video encoder 200 are performed using software executed by the programmable circuits, memory 106 (FIG. 1) may store the instructions (e.g., object code) of the software that video encoder 200 receives and executes, or another memory within video encoder 200 (not shown) may store such instructions.

Video data memory 230 is configured to store received video data. Video encoder 200 may retrieve a picture of the video data from video data memory 230 and provide the video data to residual generation unit 204 and mode selection unit 202. Video data in video data memory 230 may be raw video data that is to be encoded.

Mode selection unit 202 includes a motion estimation unit 222, a motion compensation unit 224, and an intra-prediction unit 226. Mode selection unit 202 may include additional functional units to perform video prediction in accordance with other prediction modes. As examples, mode selection unit 202 may include a palette unit, an intra-block copy unit (which may be part of motion estimation unit 222 and/or motion compensation unit 224), an affine unit, a linear model (LM) unit, or the like.

Mode selection unit 202 generally coordinates multiple encoding passes to test combinations of encoding parameters and resulting rate-distortion values for such combinations. The encoding parameters may include partitioning of CTUs into CUs, prediction modes for the CUs, transform types for residual data of the CUs, quantization parameters for residual data of the CUs, and so on. Mode selection unit 202 may ultimately select the combination of encoding parameters having rate-distortion values that are better than the other tested combinations.

Video encoder 200 may partition a picture retrieved from video data memory 230 into a series of CTUs, and encapsulate one or more CTUs within a slice. Mode selection unit 202 may partition a CTU of the picture in accordance with a tree structure, such as the QTBT structure or the quad-tree structure of HEVC described above. As described above, video encoder 200 may form one or more CUs from partitioning a CTU according to the tree structure. Such a CU may also be referred to generally as a “video block” or “block.”

In general, mode selection unit 202 also controls the components thereof (e.g., motion estimation unit 222, motion compensation unit 224, and intra-prediction unit 226) to generate a prediction block for a current block (e.g., a current CU, or in HEVC, the overlapping portion of a PU and a TU). For inter-prediction of a current block, motion estimation unit 222 may perform a motion search to identify one or more closely matching reference blocks in one or more reference pictures (e.g., one or more previously coded pictures stored in DPB 218). In particular, motion estimation unit 222 may calculate a value representative of how similar a potential reference block is to the current block, e.g., according to sum of absolute difference (SAD), sum of squared differences (SSD), mean absolute difference (MAD), mean squared differences (MSD), or the like. Motion estimation unit 222 may generally perform these calculations using sample-by-sample differences between the current block and the reference block being considered. Motion estimation unit 222 may identify a reference block having a lowest value resulting from these calculations, indicating a reference block that most closely matches the current block.

Motion estimation unit 222 may form one or more motion vectors (MVs) that defines the positions of the reference blocks in the reference pictures relative to the position of the current block in a current picture. Motion estimation unit 222 may then provide the motion vectors to motion compensation unit 224. For example, for uni-directional inter-prediction, motion estimation unit 222 may provide a single motion vector, whereas for bi-directional inter-prediction, motion estimation unit 222 may provide two motion vectors. Motion compensation unit 224 may then generate a prediction block using the motion vectors. For example, motion compensation unit 224 may retrieve data of the reference block using the motion vector. As another example, if the motion vector has fractional sample precision, motion compensation unit 224 may interpolate values for the prediction block according to one or more interpolation filters. Moreover, for bi-directional inter-prediction, motion compensation unit 224 may retrieve data for two reference blocks identified by respective motion vectors and combine the retrieved data, e.g., through sample-by-sample averaging or weighted averaging.

As another example, for intra-prediction, or intra-prediction coding, intra-prediction unit 226 may generate the prediction block from samples neighboring the current block. For example, for directional modes, intra-prediction unit 226 may generally mathematically combine values of neighboring samples and populate these calculated values in the defined direction across the current block to produce the prediction block. As another example, for DC mode, intra-prediction unit 226 may calculate an average of the neighboring samples to the current block and generate the prediction block to include this resulting average for each sample of the prediction block.

Mode selection unit 202 provides the prediction block to residual generation unit 204. Residual generation unit 204 receives a raw, unencoded version of the current block from video data memory 230 and the prediction block from mode selection unit 202. Residual generation unit 204 calculates sample-by-sample differences between the current block and the prediction block. The resulting sample-by-sample differences define a residual block for the current block. In some examples, residual generation unit 204 may also determine differences between sample values in the residual block to generate a residual block using residual differential pulse code modulation (RDPCM). In some examples, residual generation unit 204 may be formed using one or more subtractor circuits that perform binary subtraction.

In examples where mode selection unit 202 partitions CUs into PUs, each PU may be associated with a luma prediction unit and corresponding chroma prediction units. Video encoder 200 and video decoder 300 may support PUs having various sizes. As indicated above, the size of a CU may refer to the size of the luma coding block of the CU and the size of a PU may refer to the size of a luma prediction unit of the PU. Assuming that the size of a particular CU is 2N×2N, video encoder 200 may support PU sizes of 2N×2N or N×N for intra prediction, and symmetric PU sizes of 2N×2N, 2N×N, N×2N, N×N, or similar for inter prediction. Video encoder 200 and video decoder 300 may also support asymmetric partitioning for PU sizes of 2N×nU, 2N×nD, nL×2N, and nR×2N for inter prediction.

In examples where mode selection unit 202 does not further partition a CU into PUs, each CU may be associated with a luma coding block and corresponding chroma coding blocks. As above, the size of a CU may refer to the size of the luma coding block of the CU. The video encoder 200 and video decoder 300 may support CU sizes of 2N×2N, 2N×N, or N×2N.

For other video coding techniques such as an intra-block copy mode coding, an affine-mode coding, and linear model (LM) mode coding, as some examples, mode selection unit 202, via respective units associated with the coding techniques, generates a prediction block for the current block being encoded. In some examples, such as palette mode coding, mode selection unit 202 may not generate a prediction block, and instead generate syntax elements that indicate the manner in which to reconstruct the block based on a selected palette. In such modes, mode selection unit 202 may provide these syntax elements to entropy encoding unit 220 to be encoded.

As described above, residual generation unit 204 receives the video data for the current block and the corresponding prediction block. Residual generation unit 204 then generates a residual block for the current block. To generate the residual block, residual generation unit 204 calculates sample-by-sample differences between the prediction block and the current block.

Transform processing unit 206 applies one or more transforms to the residual block to generate a block of transform coefficients (referred to herein as a “transform coefficient block”). Transform processing unit 206 may apply various transforms to a residual block to form the transform coefficient block. For example, transform processing unit 206 may apply a discrete cosine transform (DCT), a directional transform, a Karhunen-Loeve transform (KLT), or a conceptually similar transform to a residual block. In some examples, transform processing unit 206 may perform multiple transforms to a residual block, e.g., a primary transform and a secondary transform, such as a rotational transform. In some examples, transform processing unit 206 does not apply transforms to a residual block.

Quantization unit 208 may quantize the transform coefficients in a transform coefficient block, to produce a quantized transform coefficient block. Quantization unit 208 may quantize transform coefficients of a transform coefficient block according to a quantization parameter (QP) value associated with the current block. Video encoder 200 (e.g., via mode selection unit 202) may adjust the degree of quantization applied to the transform coefficient blocks associated with the current block by adjusting the QP value associated with the CU. Quantization may introduce loss of information, and thus, quantized transform coefficients may have lower precision than the original transform coefficients produced by transform processing unit 206.

Inverse quantization unit 210 and inverse transform processing unit 212 may apply inverse quantization and inverse transforms to a quantized transform coefficient block, respectively, to reconstruct a residual block from the transform coefficient block. Reconstruction unit 214 may produce a reconstructed block corresponding to the current block (albeit potentially with some degree of distortion) based on the reconstructed residual block and a prediction block generated by mode selection unit 202. For example, reconstruction unit 214 may add samples of the reconstructed residual block to corresponding samples from the prediction block generated by mode selection unit 202 to produce the reconstructed block.

Filter unit 216 may perform one or more filter operations on reconstructed blocks. For example, filter unit 216 may perform deblocking operations to reduce blockiness artifacts along edges of CUs. Operations of filter unit 216 may be skipped, in some examples. In some examples, filter unit 216 may be configured to apply an adaptive loop filter and may be configured to use any of the adaptive loop filter techniques described in this disclosure. For example, filter unit 216 may be configured to determine an ALF from one of multiple ALF filter sets in an APS. Video encoder 200 may also be configured to encode multiple ALF filter sets in one or more APSs and encode the multiple ALF filter sets in the APSs in an encoded video bitstream.

Video encoder 200 stores reconstructed blocks in DPB 218. For instance, in examples where operations of filter unit 216 are not performed, reconstruction unit 214 may store reconstructed blocks to DPB 218. In examples where operations of filter unit 216 are performed, filter unit 216 may store the filtered reconstructed blocks to DPB 218. Motion estimation unit 222 and motion compensation unit 224 may retrieve a reference picture from DPB 218, formed from the reconstructed (and potentially filtered) blocks, to inter-predict blocks of subsequently encoded pictures. In addition, intra-prediction unit 226 may use reconstructed blocks in DPB 218 of a current picture to intra-predict other blocks in the current picture.

In general, entropy encoding unit 220 may entropy encode syntax elements received from other functional components of video encoder 200. For example, entropy encoding unit 220 may entropy encode quantized transform coefficient blocks from quantization unit 208. As another example, entropy encoding unit 220 may entropy encode prediction syntax elements (e.g., motion information for inter-prediction or intra-mode information for intra-prediction) from mode selection unit 202. Entropy encoding unit 220 may perform one or more entropy encoding operations on the syntax elements, which are another example of video data, to generate entropy-encoded data. For example, entropy encoding unit 220 may perform a context-adaptive variable length coding (CAVLC) operation, a CABAC operation, a variable-to-variable (V2V) length coding operation, a syntax-based context-adaptive binary arithmetic coding (SBAC) operation, a Probability Interval Partitioning Entropy (PIPE) coding operation, an Exponential-Golomb encoding operation, or another type of entropy encoding operation on the data. In some examples, entropy encoding unit 220 may operate in bypass mode where syntax elements are not entropy encoded.

Video encoder 200 may output a bitstream that includes the entropy encoded syntax elements needed to reconstruct blocks of a slice or picture. In particular, entropy encoding unit 220 may output the bitstream.

The operations described above are described with respect to a block. Such description should be understood as being operations for a luma coding block and/or chroma coding blocks. As described above, in some examples, the luma coding block and chroma coding blocks are luma and chroma components of a CU. In some examples, the luma coding block and the chroma coding blocks are luma and chroma components of a PU.

In some examples, operations performed with respect to a luma coding block need not be repeated for the chroma coding blocks. As one example, operations to identify a motion vector (MV) and reference picture for a luma coding block need not be repeated for identifying a MV and reference picture for the chroma blocks. Rather, the MV for the luma coding block may be scaled to determine the MV for the chroma blocks, and the reference picture may be the same. As another example, the intra-prediction process may be the same for the luma coding block and the chroma coding blocks.

Video encoder 200 represents an example of a device configured to encode video data including a memory configured to store video data, and one or more processing units implemented in circuitry and configured to code multiple adaptive loop filter sets in an adaptation parameter set, and apply one or more adaptive loop filters from the multiple adaptive loop filter sets to the video data.

FIG. 13 is a block diagram illustrating an example video decoder 300 that may perform the techniques of this disclosure. FIG. 13 is provided for purposes of explanation and is not limiting on the techniques as broadly exemplified and described in this disclosure. For purposes of explanation, this disclosure describes video decoder 300 according to the techniques of VVC (ITU-T H.266, under development), and HEVC (ITU-T H.265). However, the techniques of this disclosure may be performed by video coding devices that are configured to other video coding standards.

In the example of FIG. 13, video decoder 300 includes coded picture buffer (CPB) memory 320, entropy decoding unit 302, prediction processing unit 304, inverse quantization unit 306, inverse transform processing unit 308, reconstruction unit 310, filter unit 312, and decoded picture buffer (DPB) 314. Any or all of CPB memory 320, entropy decoding unit 302, prediction processing unit 304, inverse quantization unit 306, inverse transform processing unit 308, reconstruction unit 310, filter unit 312, and DPB 314 may be implemented in one or more processors or in processing circuitry. For instance, the units of video decoder 300 may be implemented as one or more circuits or logic elements as part of hardware circuitry, or as part of a processor, ASIC, or FPGA. Moreover, video decoder 300 may include additional or alternative processors or processing circuitry to perform these and other functions.

Prediction processing unit 304 includes motion compensation unit 316 and intra-prediction unit 318. Prediction processing unit 304 may include additional units to perform prediction in accordance with other prediction modes. As examples, prediction processing unit 304 may include a palette unit, an intra-block copy unit (which may form part of motion compensation unit 316), an affine unit, a linear model (LM) unit, or the like. In other examples, video decoder 300 may include more, fewer, or different functional components.

CPB memory 320 may store video data, such as an encoded video bitstream, to be decoded by the components of video decoder 300. The video data stored in CPB memory 320 may be obtained, for example, from computer-readable medium 110 (FIG. 1). CPB memory 320 may include a CPB that stores encoded video data (e.g., syntax elements) from an encoded video bitstream. Also, CPB memory 320 may store video data other than syntax elements of a coded picture, such as temporary data representing outputs from the various units of video decoder 300. DPB 314 generally stores decoded pictures, which video decoder 300 may output and/or use as reference video data when decoding subsequent data or pictures of the encoded video bitstream. CPB memory 320 and DPB 314 may be formed by any of a variety of memory devices, such as DRAM, including SDRAM, MRAM, RRAM, or other types of memory devices. CPB memory 320 and DPB 314 may be provided by the same memory device or separate memory devices. In various examples, CPB memory 320 may be on-chip with other components of video decoder 300, or off-chip relative to those components.

Additionally or alternatively, in some examples, video decoder 300 may retrieve coded video data from memory 120 (FIG. 1). That is, memory 120 may store data as discussed above with CPB memory 320. Likewise, memory 120 may store instructions to be executed by video decoder 300, when some or all of the functionality of video decoder 300 is implemented in software to be executed by processing circuitry of video decoder 300.

The various units shown in FIG. 13 are illustrated to assist with understanding the operations performed by video decoder 300. The units may be implemented as fixed-function circuits, programmable circuits, or a combination thereof. Similar to FIG. 12, fixed-function circuits refer to circuits that provide particular functionality, and are preset on the operations that can be performed. Programmable circuits refer to circuits that can be programmed to perform various tasks, and provide flexible functionality in the operations that can be performed. For instance, programmable circuits may execute software or firmware that cause the programmable circuits to operate in the manner defined by instructions of the software or firmware. Fixed-function circuits may execute software instructions (e.g., to receive parameters or output parameters), but the types of operations that the fixed-function circuits perform are generally immutable. In some examples, one or more of the units may be distinct circuit blocks (fixed-function or programmable), and in some examples, one or more of the units may be integrated circuits.

Video decoder 300 may include ALUs, EFUs, digital circuits, analog circuits, and/or programmable cores formed from programmable circuits. In examples where the operations of video decoder 300 are performed by software executing on the programmable circuits, on-chip or off-chip memory may store instructions (e.g., object code) of the software that video decoder 300 receives and executes.

Entropy decoding unit 302 may receive encoded video data from the CPB and entropy decode the video data to reproduce syntax elements. Prediction processing unit 304, inverse quantization unit 306, inverse transform processing unit 308, reconstruction unit 310, and filter unit 312 may generate decoded video data based on the syntax elements extracted from the bitstream.

In general, video decoder 300 reconstructs a picture on a block-by-block basis. Video decoder 300 may perform a reconstruction operation on each block individually (where the block currently being reconstructed, i.e., decoded, may be referred to as a “current block”).

Entropy decoding unit 302 may entropy decode syntax elements defining quantized transform coefficients of a quantized transform coefficient block, as well as transform information, such as a quantization parameter (QP) and/or transform mode indication(s). Inverse quantization unit 306 may use the QP associated with the quantized transform coefficient block to determine a degree of quantization and, likewise, a degree of inverse quantization for inverse quantization unit 306 to apply. Inverse quantization unit 306 may, for example, perform a bitwise left-shift operation to inverse quantize the quantized transform coefficients. Inverse quantization unit 306 may thereby form a transform coefficient block including transform coefficients.

After inverse quantization unit 306 forms the transform coefficient block, inverse transform processing unit 308 may apply one or more inverse transforms to the transform coefficient block to generate a residual block associated with the current block. For example, inverse transform processing unit 308 may apply an inverse DCT, an inverse integer transform, an inverse Karhunen-Loeve transform (KLT), an inverse rotational transform, an inverse directional transform, or another inverse transform to the transform coefficient block.

Furthermore, prediction processing unit 304 generates a prediction block according to prediction information syntax elements that were entropy decoded by entropy decoding unit 302. For example, if the prediction information syntax elements indicate that the current block is inter-predicted, motion compensation unit 316 may generate the prediction block. In this case, the prediction information syntax elements may indicate a reference picture in DPB 314 from which to retrieve a reference block, as well as a motion vector identifying a location of the reference block in the reference picture relative to the location of the current block in the current picture. Motion compensation unit 316 may generally perform the inter-prediction process in a manner that is substantially similar to that described with respect to motion compensation unit 224 (FIG. 12).

As another example, if the prediction information syntax elements indicate that the current block is intra-predicted, intra-prediction unit 318 may generate the prediction block according to an intra-prediction mode indicated by the prediction information syntax elements. Again, intra-prediction unit 318 may generally perform the intra-prediction process in a manner that is substantially similar to that described with respect to intra-prediction unit 226 (FIG. 12). Intra-prediction unit 318 may retrieve data of neighboring samples to the current block from DPB 314.

Reconstruction unit 310 may reconstruct the current block using the prediction block and the residual block. For example, reconstruction unit 310 may add samples of the residual block to corresponding samples of the prediction block to reconstruct the current block.

Filter unit 312 may perform one or more filter operations on reconstructed blocks. For example, filter unit 312 may perform deblocking operations to reduce blockiness artifacts along edges of the reconstructed blocks. Operations of filter unit 312 are not necessarily performed in all examples. Filter unit 312 may be configured to apply an adaptive loop filter and may be configured to use any of the adaptive loop filtering techniques described in this disclosure. For example, filter unit 312 may be configured to receive multiple adaptive loop filter sets in an adaptation parameter set associated with the video data, determine one or more adaptive loop filters from the multiple adaptive loop filter sets, and apply the determined one or more adaptive loop filters to the video data.

Video decoder 300 may store the reconstructed blocks in DPB 314. For instance, in examples where operations of filter unit 312 are not performed, reconstruction unit 310 may store reconstructed blocks to DPB 314. In examples where operations of filter unit 312 are performed, filter unit 312 may store the filtered reconstructed blocks to DPB 314. As discussed above, DPB 314 may provide reference information, such as samples of a current picture for intra-prediction and previously decoded pictures for subsequent motion compensation, to prediction processing unit 304. Moreover, video decoder 300 may output decoded pictures (e.g., decoded video) from DPB 314 for subsequent presentation on a display device, such as display device 118 of FIG. 1.

In this manner, video decoder 300 represents an example of a video decoding device including a memory configured to store video data, and one or more processing units implemented in circuitry and configured to receive multiple adaptive loop filter sets in an adaptation parameter set associated with the video data, determine one or more adaptive loop filters from the multiple adaptive loop filter sets, and apply the determined one or more adaptive loop filters to the video data.

FIG. 14 is a flowchart illustrating an example method for encoding a current block in accordance with the techniques of this disclosure. The current block may comprise a current CU. Although described with respect to video encoder 200 (FIGS. 1 and 12), it should be understood that other devices may be configured to perform a method similar to that of FIG. 14.

In this example, video encoder 200 initially predicts the current block (350). For example, video encoder 200 may form a prediction block for the current block. Video encoder 200 may then calculate a residual block for the current block (352). To calculate the residual block, video encoder 200 may calculate a difference between the original, unencoded block and the prediction block for the current block. Video encoder 200 may then transform the residual block and quantize transform coefficients of the residual block (354). Next, video encoder 200 may scan the quantized transform coefficients of the residual block (356). During the scan, or following the scan, video encoder 200 may entropy encode the transform coefficients (358). For example, video encoder 200 may encode the transform coefficients using CAVLC or CABAC. Video encoder 200 may then output the entropy encoded data of the block (360).

FIG. 15 is a flowchart illustrating an example method for decoding a current block of video data in accordance with the techniques of this disclosure. The current block may comprise a current CU. Although described with respect to video decoder 300 (FIGS. 1 and 13), it should be understood that other devices may be configured to perform a method similar to that of FIG. 15.

Video decoder 300 may receive entropy encoded data for the current block, such as entropy encoded prediction information and entropy encoded data for transform coefficients of a residual block corresponding to the current block (370). Video decoder 300 may entropy decode the entropy encoded data to determine prediction information for the current block and to reproduce transform coefficients of the residual block (372). Video decoder 300 may predict the current block (374), e.g., using an intra- or inter-prediction mode as indicated by the prediction information for the current block, to calculate a prediction block for the current block. Video decoder 300 may then inverse scan the reproduced transform coefficients (376), to create a block of quantized transform coefficients. Video decoder 300 may then inverse quantize the transform coefficients and apply an inverse transform to the transform coefficients to produce a residual block (378). Video decoder 300 may ultimately decode the current block by combining the prediction block and the residual block (380). After decoding the current block, video decoder 300 may apply a filter, such as an ALF, using the techniques of this disclosure.

FIG. 16 is a flowchart illustrating another example method for decoding a current block in accordance with the techniques of this disclosure. FIG. 16 illustrates a method for applying an ALF in accordance with this disclosure. The techniques of FIG. 16 may be performed by one or more structural units of video decoder 300, including filter unit 312.

In one example, video decoder 300 may be configured to receive multiple adaptive loop filter sets in an adaptation parameter set associated with the video data (500), determine one or more adaptive loop filters from the multiple adaptive loop filter sets (510), and apply the determined one or more adaptive loop filters to the video data (520). In one example, the multiple adaptive loop filter sets include multiple adaptive loop filter sets for luma components of the video data and multiple adaptive loop filter sets for chroma components of the video data. In another example, the multiple adaptive loop filter sets include multiple cross-component adaptive loop filter sets for Cb components of the video data and multiple cross-component adaptive loop filter sets for Cr components of the video data.

In another example, video decoder 300 may be configured to decode, for a coding tree block, a filter set index that indicates a particular adaptive loop filter set of the multiple adaptive loop filter sets in the adaptation parameter set, decode, for the coding tree block, a filter index that indicates a particular adaptive loop filter from the particular adaptive loop filter set, and apply the particular adaptive loop filter to the coding tree block. Video decoder 300 may be further configured to decode, for the coding tree block of the video data, an adaptation parameter set index that indicates the adaptation parameter set.

In another example, video decoder 300 may be configured to decode a first syntax element that indicates a number of adaptive loop filter sets in the adaptation parameter set for luma components of the video data. In another example, video decoder 300 may be configured to decode a second syntax element that indicates a number of adaptive loop filter sets in the adaptation parameter set for chroma components of the video data.

In another example, video decoder 300 may be configured to decode a clipping flag that is applicable for all adaptive loop filter sets of the multiple adaptive loop filter sets for luma components, and decode a clipping flag that is applicable for all adaptive loop filter sets of the multiple adaptive loop filter sets for chroma components.

In another example, video decoder 300 may be configured to decode a respective clipping flag for each adaptive loop filter set of the multiple adaptive loop filter sets for luma components, and decode a respective clipping flag for each adaptive loop filter set of the multiple adaptive loop filter sets for chroma components.

In another example, video decoder 300 may be configured to decode, at a picture header, one or more syntax elements that indicate which adaptive loop filter sets of the multiple adaptive loop filter sets are available for a picture of the video data, and apply the indicated adaptive loop filter sets to the picture of the video data.

In another example, video decoder 300 may be configured to decode, at a sub-picture header, one or more syntax elements that indicate which adaptive loop filter sets of the multiple adaptive loop filter sets are available for a sub-picture of the video data, wherein the sub-picture includes a sub-picture, a slice, a tile, a tile group, or a brick of the video data, and apply the indicated adaptive loop filter sets to the sub-picture of the video data.

Other illustrative examples of the disclosure are described below.

Clause 1—A method of coding video data, the method comprising: coding multiple adaptive loop filter sets in an adaptation parameter set; and applying one or more adaptive loop filters from the multiple adaptive loop filter sets to the video data.

Clause 2—The method of Clause 1, wherein the multiple adaptive loop filter sets include multiple adaptive loop filter sets for luma components, multiple adaptive loop filter sets for chroma components, multiple cross-component adaptive loop filter sets for Cb components, and multiple cross-component adaptive loop filter sets for Cr components.

Clause 3—The method of Clause 2, further comprising: coding a first syntax element that indicates a number of adaptive loop filter sets for luma components.

Clause 4—The method of Clause 2, further comprising: coding a second syntax element that indicates a number of adaptive loop filter sets for chroma components.

Clause 5—The method of Clause 2, further comprising: coding a clipping flag that is applicable for all adaptive loop filter sets of the multiple adaptive loop filter sets for luma components.

Clause 6—The method of Clause 2, further comprising: coding a clipping flag that is applicable for all adaptive loop filter sets of the multiple adaptive loop filter sets for chroma components.

Clause 7—The method of Clause 2, further comprising: coding a respective clipping flag for each adaptive loop filter set of the multiple adaptive loop filter sets for luma components.

Clause 8—The method of Clause 2, further comprising: coding a respective clipping flag for each adaptive loop filter set of the multiple adaptive loop filter sets for chroma components.

Clause 9—The method of Clause 1, further comprising: coding a filter set index that indicates an adaptive loop filter set of the multiple adaptive loop filter sets.

Clause 10—The method of any combination of Clauses 1-9.

Clause 11—The method of any of Clauses 1-10, wherein coding comprises decoding.

Clause 12—The method of any of Clauses 1-10, wherein coding comprises encoding.

Clause 13—A device for coding video data, the device comprising one or more means for performing the method of any of Clauses 1-12.

Clause 14—The device of Clause 13, wherein the one or more means comprise one or more processors implemented in circuitry.

Clause 15—The device of any of Clauses 13 and 14, further comprising a memory to store the video data.

Clause 16—The device of any of Clauses 13-15, further comprising a display configured to display decoded video data.

Clause 17—The device of any of Clauses 13-16, wherein the device comprises one or more of a camera, a computer, a mobile device, a broadcast receiver device, or a set-top box.

Clause 18—The device of any of Clauses 13-17, wherein the device comprises a video decoder.

Clause 19—The device of any of Clauses 13-18, wherein the device comprises a video encoder.

Clause 20—A computer-readable storage medium having stored thereon instructions that, when executed, cause one or more processors to perform the method of any of Clauses 1-12.

Clause 21—Any combination of techniques described in this disclosure.

It is to be recognized that depending on the example, certain acts or events of any of the techniques described herein can be performed in a different sequence, may be added, merged, or left out altogether (e.g., not all described acts or events are necessary for the practice of the techniques). Moreover, in certain examples, acts or events may be performed concurrently, e.g., through multi-threaded processing, interrupt processing, or multiple processors, rather than sequentially.

In one or more examples, the functions described may be implemented in hardware, software, firmware, or any combination thereof. If implemented in software, the functions may be stored on or transmitted over as one or more instructions or code on a computer-readable medium and executed by a hardware-based processing unit. Computer-readable media may include computer-readable storage media, which corresponds to a tangible medium such as data storage media, or communication media including any medium that facilitates transfer of a computer program from one place to another, e.g., according to a communication protocol. In this manner, computer-readable media generally may correspond to (1) tangible computer-readable storage media which is non-transitory or (2) a communication medium such as a signal or carrier wave. Data storage media may be any available media that can be accessed by one or more computers or one or more processors to retrieve instructions, code and/or data structures for implementation of the techniques described in this disclosure. A computer program product may include a computer-readable medium.

By way of example, and not limitation, such computer-readable storage media can comprise RAM, ROM, EEPROM, CD-ROM or other optical disk storage, magnetic disk storage, or other magnetic storage devices, flash memory, or any other medium that can be used to store desired program code in the form of instructions or data structures and that can be accessed by a computer. Also, any connection is properly termed a computer-readable medium. For example, if instructions are transmitted from a website, server, or other remote source using a coaxial cable, fiber optic cable, twisted pair, digital subscriber line (DSL), or wireless technologies such as infrared, radio, and microwave, then the coaxial cable, fiber optic cable, twisted pair, DSL, or wireless technologies such as infrared, radio, and microwave are included in the definition of medium. It should be understood, however, that computer-readable storage media and data storage media do not include connections, carrier waves, signals, or other transitory media, but are instead directed to non-transitory, tangible storage media. Disk and disc, as used herein, includes compact disc (CD), laser disc, optical disc, digital versatile disc (DVD), floppy disk and Blu-ray disc, where disks usually reproduce data magnetically, while discs reproduce data optically with lasers. Combinations of the above should also be included within the scope of computer-readable media.

Instructions may be executed by one or more processors, such as one or more DSPs, general purpose microprocessors, ASICs, FPGAs, or other equivalent integrated or discrete logic circuitry. Accordingly, the terms “processor” and “processing circuitry,” as used herein may refer to any of the foregoing structures or any other structure suitable for implementation of the techniques described herein. In addition, in some aspects, the functionality described herein may be provided within dedicated hardware and/or software modules configured for encoding and decoding, or incorporated in a combined codec. Also, the techniques could be fully implemented in one or more circuits or logic elements.

The techniques of this disclosure may be implemented in a wide variety of devices or apparatuses, including a wireless handset, an integrated circuit (IC) or a set of ICs (e.g., a chip set). Various components, modules, or units are described in this disclosure to emphasize functional aspects of devices configured to perform the disclosed techniques, but do not necessarily require realization by different hardware units. Rather, as described above, various units may be combined in a codec hardware unit or provided by a collection of interoperative hardware units, including one or more processors as described above, in conjunction with suitable software and/or firmware.

Various examples have been described. These and other examples are within the scope of the following claims. 

1. A method of decoding video data, the method comprising: receiving multiple adaptive loop filter sets in an adaptation parameter set associated with the video data; decoding, for a luma coding tree block of the video data, a filter set index that indicates a particular adaptive loop filter set of the multiple adaptive loop filter sets in the adaptation parameter set; decoding, for the luma coding tree block, a filter index that indicates a particular adaptive loop filter from the particular adaptive loop filter set; and applying the particular adaptive loop filter to the luma coding tree block of the video data.
 2. (canceled)
 3. The method of claim 1 further comprising: decoding, for the luma coding tree block of the video data, an adaptation parameter set index that indicates the adaptation parameter set.
 4. The method of claim 1, wherein the multiple adaptive loop filter sets include multiple adaptive loop filter sets for luma components of the video data and multiple adaptive loop filter sets for chroma components of the video data.
 5. The method of claim 1, wherein the multiple adaptive loop filter sets include multiple cross-component adaptive loop filter sets for Cb components of the video data and multiple cross-component adaptive loop filter sets for Cr components of the video data.
 6. The method of claim 1, further comprising: decoding a first syntax element that indicates a number of adaptive loop filter sets in the adaptation parameter set for luma components of the video data; and decoding a second syntax element that indicates a number of adaptive loop filter sets in the adaptation parameter set for chroma components of the video data.
 7. The method of claim 1, further comprising: decoding a clipping flag that is applicable for all adaptive loop filter sets of the multiple adaptive loop filter sets for luma components; and decoding a clipping flag that is applicable for all adaptive loop filter sets of the multiple adaptive loop filter sets for chroma components.
 8. The method of claim 1, further comprising: decoding a respective clipping flag for each adaptive loop filter set of the multiple adaptive loop filter sets for luma components; and decoding a respective clipping flag for each adaptive loop filter set of the multiple adaptive loop filter sets for chroma components.
 9. The method of claim 1, further comprising: decoding, at a picture header, one or more syntax elements that indicate which adaptive loop filter sets of the multiple adaptive loop filter sets are available for a picture of the video data; and applying the indicated adaptive loop filter sets to the picture of the video data.
 10. The method of claim 1, further comprising: decoding, at a sub-picture header, one or more syntax elements that indicate which adaptive loop filter sets of the multiple adaptive loop filter sets are available for a sub-picture of the video data, wherein the sub-picture includes a sub-picture, a slice, a tile, a tile group, or a brick of the video data; and applying the indicated adaptive loop filter sets to the sub-picture of the video data.
 11. The method of claim 1, further comprising: displaying the video data.
 12. An apparatus configured to decode video data, the apparatus comprising: a memory configured to store the video data; and one or more processors implemented in circuitry and in communication with the memory, the one or more processors configured to: receive multiple adaptive loop filter sets in an adaptation parameter set associated with the video data; decode, for a luma coding tree block of the video data, a filter set index that indicates a particular adaptive loop filter set of the multiple adaptive loop filter sets in the adaptation parameter set; decode, for the luma coding tree block, a filter index that indicates a particular adaptive loop filter from the particular adaptive loop filter set; and apply the particular adaptive loop filter to the luma coding tree block of the video data.
 13. (canceled)
 14. The apparatus of claim 12, wherein the one or more processors are further configured to: decode, for the luma coding tree block of the video data, an adaptation parameter set index that indicates the adaptation parameter set.
 15. The apparatus of claim 12, wherein the multiple adaptive loop filter sets include multiple adaptive loop filter sets for luma components of the video data and multiple adaptive loop filter sets for chroma components of the video data.
 16. The apparatus of claim 12, wherein the multiple adaptive loop filter sets include multiple cross-component adaptive loop filter sets for Cb components of the video data and multiple cross-component adaptive loop filter sets for Cr components of the video data.
 17. The apparatus of claim 12, wherein the one or more processors are further configured to: decode a first syntax element that indicates a number of adaptive loop filter sets in the adaptation parameter set for luma components of the video data; and decode a second syntax element that indicates a number of adaptive loop filter sets in the adaptation parameter set for chroma components of the video data.
 18. The apparatus of claim 12, wherein the one or more processors are further configured to: decode a clipping flag that is applicable for all adaptive loop filter sets of the multiple adaptive loop filter sets for luma components; and decode a clipping flag that is applicable for all adaptive loop filter sets of the multiple adaptive loop filter sets for chroma components.
 19. The apparatus of claim 12, wherein the one or more processors are further configured to: decode a respective clipping flag for each adaptive loop filter set of the multiple adaptive loop filter sets for luma components; and decode a respective clipping flag for each adaptive loop filter set of the multiple adaptive loop filter sets for chroma components.
 20. The apparatus of claim 12, wherein the one or more processors are further configured to: decode, at a picture header, one or more syntax elements that indicate which adaptive loop filter sets of the multiple adaptive loop filter sets are available for a picture of the video data; and apply the indicated adaptive loop filter sets to the picture of the video data.
 21. The apparatus of claim 12, wherein the one or more processors are further configured to: decode, at a sub-picture header, one or more syntax elements that indicate which adaptive loop filter sets of the multiple adaptive loop filter sets are available for a sub-picture of the video data, wherein the sub-picture includes a sub-picture, a slice, a tile, a tile group, or a brick of the video data; and apply the indicated adaptive loop filter sets to the sub-picture of the video data.
 22. The apparatus of claim 12, further comprising: a display configured to display the video data.
 23. An apparatus configured to decode video data, the apparatus comprising: means for receiving multiple adaptive loop filter sets in an adaptation parameter set associated with the video data; means for decoding, for a luma coding tree block of the video data, a filter set index that indicates a particular adaptive loop filter set of the multiple adaptive loop filter sets in the adaptation parameter set; means for decoding, for the luma coding tree block, a filter index that indicates a particular adaptive loop filter from the particular adaptive loop filter set; and means for applying the particular adaptive loop filter to the luma coding tree block of the video data.
 24. A non-transitory computer-readable storage medium storing instructions that, when executed, cause one or more processors of a device configured to decode video data to: receive multiple adaptive loop filter sets in an adaptation parameter set associated with the video data; decode, for a luma coding tree block of the video data, a filter set index that indicates a particular adaptive loop filter set of the multiple adaptive loop filter sets in the adaptation parameter set; decode, for the luma coding tree block, a filter index that indicates a particular adaptive loop filter from the particular adaptive loop filter set; and apply the particular adaptive loop filter to the luma coding tree block of the video data. 